Wyniki wyszukiwania dla: algorithms

• Biomedical Engineering at Gdansk University of Technology

  Publikacja

  • A. Z. Nowakowski
  • M. Bocheńska
  • B. Mielewska
  • J. Rumiński
  • J. Wtorek

  - Bio-Algorithms and Med-Systems - Rok 2011

  Short history of education in Biomedical Engineering at Gdansk University of Technology is presented. The last initiative- implementation of the new programme, Biomedical Engineering - an interfaculty direction of study, supported by a grantfinanced by the European Social Fund is presented. Curricula of four specializations: Chemistry in Medicine, run by the Facultyof Chemistry; Electronics in Medicine and Informatics in Medicine,...

  Pełny tekst do pobrania w serwisie zewnętrznym

• Proteomic profiling of exosomes derived from pancreatic beta-cells cultured under hyperglycemia

  Publikacja

  • C. Rząca
  • U. Jankowska
  • E. Stępień

  - Bio-Algorithms and Med-Systems - Rok 2022

  Pełny tekst do pobrania w serwisie zewnętrznym

• A Monte Carlo Strategy to simulate Positrons and Positronium in biological Materials

  Publikacja

  • M. Franz
  • J. Franz

  - Bio-Algorithms and Med-Systems - Rok 2023

  We present an algorithm for Monte Carlo simulations of positron tracks in biological materials. The algorithm takes into account the cross-section data for elastic and inelastic collisions between positrons and molecules and processes like direct annihilation, ionization and positronium formation. In the case of positronium formation, the algorithm considers the interactions of positronium with molecules. The algorithm can be used...

  Pełny tekst do pobrania w portalu

• Reconfiguring Minimum Dominating Sets in Trees

  Publikacja

  • M. Lemańska
  • P. Żyliński

  - Journal of Graph Algorithms and Applications - Rok 2020

  We provide tight bounds on the diameter of γ-graphs, which are reconfiguration graphs of the minimum dominating sets of a graph G. In particular, we prove that for any tree T of order n ≥ 3, the diameter of its γ-graph is at most n/2 in the single vertex replacement adjacency model, whereas in the slide adjacency model, it is at most 2(n − 1)/3. Our proof is constructive, leading to a simple linear-time algorithm for determining...

  Pełny tekst do pobrania w portalu

• International Symposium on Experimental Algorithms

  Konferencje

• The International Workshop on Algorithms and Graphs

  Konferencje

• Stochastic Local Search Algorithms

  Konferencje

• Cryptography Policy and Algorithms Conference

  Konferencje

• Conference on Orders, Algorithms and Applications

  Konferencje

• IEEE Workshop on Memetic Algorithms

  Konferencje

• International Symposium on Algorithms and Computation

  Konferencje

• Workshop on Approximation and Online Algorithms

  Konferencje

• Symposium on Parallelism in Algorithms and Architectures

  Konferencje

• Australasian Workshop on Combinatorial Algorithms

  Konferencje

• International Conference on Genetic Algorithms

  Konferencje

• International Workshop on Efficient Algorithms

  Konferencje

• Optimal Discrete Structures and Algorithms

  Konferencje

• Workshop on Algorithms, Combinatorics, and Geometry

  Konferencje

• International Conference on Probabilistic, Combinatorial, and Asymptotic Methods in the Analysis of Algorithms (Conference on Analysis of Algorithms)

  Konferencje

• Computability in Europe: Logic and Theory of Algorithms

  Konferencje

• Symposium of Asian Association for Algorithms and Computation

  Konferencje

• Tools and Algorithms for Construction and Analysis of Systems

  Konferencje

• Symposium on Stochastic Algorithms, Foundations and Applications

  Konferencje

• Conference on Algorithms and Hardware for Parallel Processing

  Konferencje

• International Conference and Workshop on Algorithms and Computation

  Konferencje

• ACM/SIAM Symposium on Discrete Algorithms

  Konferencje

• Workshop on Algorithms And Models For The Web Graph

  Konferencje

• International Symposium on Algorithms and Experiments for Wireless Networks

  Konferencje

• Latin-American Algorithms, Graphs and Optimization Symposium

  Konferencje

• Workshop on Approximation and Randomization Algorithms in Communication Networks

  Konferencje

• International Symposium on Parallel Architectures, Algorithms and Networks

  Konferencje

• International Conference on Algorithms and Complexity (was Italian Conference )

  Konferencje

• International Conference on Adaptive and Natural Computing Algorithms

  Konferencje

• Symposium On Combinatorics, Algorithms, Probabilistic and Experimental Methodologies

  Konferencje

• SIAM Workshop on Algorithms for Listing, Counting, and Enumeration

  Konferencje

• International Conference on Algorithms and Architectures for Parallel Processing

  Konferencje

• Workshop on Localized Algorithms and Protocols for Wireless Sensor Networks

  Konferencje

• International Workshop on Approximation Algorithms for Combinatorial Optimization Problems

  Konferencje

• International Conference on Artificial Neural Networks and Genetic Algorithms

  Konferencje

• International Symposium on Symbolic and Numeric Algorithms for Scientific Computing

  Konferencje

• IEEE Workshop on Computational Intelligence in Biometrics: Theory, Algorithms, and Applications

  Konferencje

• International Workshop on Advanced Architectures and Algorithms for Internet Delivery and Applications

  Konferencje

• Colloquium on Mathematics and Computer Science: Algorithms, Trees, Combinatorics and Probabilities

  Konferencje

• International Symposium on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes

  Konferencje

• Multimedia Content Access: Algorithms and Systems (was Multimedia Content Analysis, Management and Retrieval)

  Konferencje

• Information Systems &Technologies /SPIE Conference on Digital Video Compression Algorithms & Techniques

  Konferencje

• Joint workshop on Multimodal Interaction and Related Machine Learning Algorithms (now ICMI-MLMI)

  Konferencje

• Jarosław Sadowski dr hab. inż.

  Osoby

  Katedra Systemów i Sieci Radiokomunikacyjnych

• Michał Małafiejski dr hab. inż.

  Osoby

  Katedra Algorytmów i Modelowania Systemów

  Michał Małafiejski urodził się w 1975 roku. Uzyskał tytuł zawodowy magistra inżyniera informatyka w 1999 roku. W 2002 roku uzyskał stopień doktora nauk technicznych w dyscyplinie informatyka, a w 2014 roku stopień doktora habilitowanego w tej samej dziedzinie. Obecnie pracuje jako profesor nadzwyczajny w Katedrze Algorytmów i Modelowania Systemów. Jest autorem licznych prac z zakresu informatyki teoretycznej i matematyki dyskretnej....

• Michał Lech dr inż.

  Osoby

  Michał Lech was born in Gdynia in 1983. In 2007 he graduated from the faculty of Electronics, Telecommunications and Informatics of Gdansk University of Technology. In June 2013, he received his Ph.D. degree. The subject of the dissertation was: “A Method and Algorithms for Controlling the Sound Mixing Processes with Hand Gestures Recognized Using Computer Vision”. The main focus of the thesis was the bias of audio perception caused...