A5081722763- Computational Geometry and Mesh Generation
- Data Visualization and Analytics
- VLSI and FPGA Design Techniques
- Graph Theory and Algorithms
- Advanced Graph Theory Research
- Data Management and Algorithms
- Digital Image Processing Techniques
- Computer Graphics and Visualization Techniques
- Interconnection Networks and Systems
- Constraint Satisfaction and Optimization
- Multimedia Communication and Technology
- 3D Modeling in Geospatial Applications
- Functional Brain Connectivity Studies
- Model-Driven Software Engineering Techniques
- Advanced Numerical Analysis Techniques
- Algorithms and Data Compression
- Bioinformatics and Genomic Networks
- Optimization and Search Problems
- Neural dynamics and brain function
- Complexity and Algorithms in Graphs
- graph theory and CDMA systems
- Optimization and Packing Problems
- VLSI and Analog Circuit Testing
- Manufacturing Process and Optimization
- 3D IC and TSV technologies
University of Crete
2015-2024
FORTH Institute of Computer Science
2007-2017
Foundation for Research and Technology Hellas
2007-2016
Czech Academy of Sciences, Institute of Computer Science
2010-2014
Crete University Press
2010
Hella (Germany)
2008
Science and Technology Park of Crete
2007
Laboratoire d'Informatique de Paris-Nord
2006
The University of Texas at Dallas
1996-2006
FORTH Institute of Electronic Structure and Laser
2005
The authors consider the problem of constructing a planar grid embedding for G, where G is graph with n vertices, which maps vertices to distinct points and edges nonintersecting paths. A new algorithm presented that runs in O(n) time produces embeddings following properties: (1) total number bends at most 2.4n+2; (2) along each edge 4; (3) length every O(n); (4) area O(n/sup 2/).< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">></ETX>
European funding under framework 7 (FP7) for the virtual physiological human (VPH) project has been in place now nearly 2 years. The VPH network of excellence (NoE) is helping development common standards, open-source software, freely accessible data and model repositories, various training dissemination activities project. It also to coordinate many clinically targeted projects that have funded FP7 calls. An initial vision was defined by 6 strategy a physiome (STEP) 2006. time assess...
In this paper we investigate the problem of constructing planar straight-line drawings acyclic digraphs such that all edges flow in same direction, e.g., from bottom to top. Our contribution is twofold. First show existence a family require exponential area for any drawing. Second, motivated by preceding lower bound, relax constraint and allow bends along edges. We present linear-time algorithm produces planarst-graphs with small number bends, asymptotically optimal area, symmetries...
Difference bases are discussed and their relevance to sensor arrays is described. Several new analytical difference base structures that result in near optimal low-redundancy introduced. Algorithms also presented for efficiently obtaining sparse and/or bases. New bounds, related have both redundancies holes coarray, presented. Some extensions the idea of may yield useful results array design discussed.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML"...
Article Free Access Share on A 2n-2 step algorithm for routing in an nxn array with constant size queues Authors: T. Leighton Mathematics Department and Laboratory Computer Science, Massachusetts Institute of Technology, Cambridge, MA MAView Profile , F. Makedon University Texas at Dallas, Richardson, TX TXView I. G. Tollis Authors Info & Claims SPAA '89: Proceedings the first annual ACM symposium Parallel algorithms architecturesMarch 1989 Pages...
European funding under Framework 7 (FP7) for the virtual physiological human (VPH) project has been in place now 5 years. The VPH Network of Excellence (NoE) set up to help develop common standards, open source software, freely accessible data and model repositories, various training dissemination activities project. It is also working coordinate many clinically targeted projects that have funded FP7 calls. An initial vision was defined by FP6 STEP 2006. In 2010, we wrote an assessment...
The problem is presented in the context of some recent theoretical advances on a related problem, called random satisfiability. These results indicate limitations inherent computing signal probabilities. Such exist even if one uses Monte Carlo techniques for estimating Theoretical that any practical method devised to compute probabilities would have be evaluated purely an empirical basis. An improved algorithm offered takes into account first-order effects reconvergent input leads. It...
Metabolic interactions involve the exchange of metabolic products among microbial species. Most microbes live in communities and usually rely on to increase their supply for nutrients better exploit a given environment. Constraint-based models have successfully analyzed cellular metabolism described genotype-phenotype relations. However, there are only few studies genome-scale multi-species interactions. Based approaches, we present graph-theoretic approach together with model order explore...
Drawing graphs is an important problem that combines elements of computational geometry and graph theory. Applications can be found in a variety areas including circuit layout, network management, software engineering, graphics. The main contributions this paper summarized as follows: • We devise model for dynamic algorithms, based on performing queries updates implicit representation the drawing, we show its applications. present efficient drawing algorithms trees series-parallel digraphs....
In this paper we give a model for dynamic graph algorithms, based on performing queries and updates an implicit representation of the drawing. We present algorithms drawing planar graphs that use variety standards (such as polyline, straight-line, orthogonal, grid, upward, visibility drawings), address aesthetic criteria are important readability, such display planarity, symmetry, reachability. Also, provide techniques especially tailored subclasses trees series-parallel digraphs. Our have...
QRS detection performance can depend on the type of noise present in each lead involved overall processing. A common approach to is based a enhanced signal obtained from derivatives pre-filtered leads. However, pre-filtering cannot be able perform complete rejection and use enhance as well. In many cases occurs only one addition noisy decreases performances detector. For this reason estimation channel, providing information for channel inclusion or building signal, improve The results have...
Upward and dominance drawings of acyclic digraphs find important applications in the display hierarchical structures such as PERT diagrams, subroutine-call charts, is-a relationships. The combinatorial model underlying is often a series-parallel digraph. In this paper problem constructing upward investigated. We show that area requirement crucially depends on choice planar embedding. Also, we present efficient sequential parallel algorithms for drawing digraphs. Our results while have rather...
Among the various frameworks in which electroencephalographic (EEG) signal synchronization has been traditionally formulated, most widely studied and used is coherence that entirely based on frequency analysis. However, at present time it possible to capture information about temporal profile of coherence, particularly helpful studying non-stationary time-varying brain dynamics, like wavelet (WC). In this paper we propose a new approach dynamics by extending use WC include certain...
Consideration is given to the problem of finding a shortest path between two points in 3-D space with restricted class polyhedral obstacles (vertical buildings fixed number k distinct heights). For case when all have equal heights, shortest-path algorithm presented complexity O(n/sup 2/), i.e. same as for 2-D (n total corners obstacles). general (k heights), an time 6k-1/). Also 2/) approximation that finds paths are, at most, 8% longer than heights certain minimum separation requirements...