Sciweavers

1528 search results - page 108 / 306
» On Signatures for Communication Graphs
Sort
View
GD
2004
Springer
15 years 10 months ago
Distributed Graph Layout for Sensor Networks
Sensor network applications frequently require that the sensors know their physical locations in some global coordinate system. This is usually achieved by equipping each sensor w...
Craig Gotsman, Yehuda Koren
CORR
2008
Springer
103views Education» more  CORR 2008»
15 years 5 months ago
Stabilizer Quantum Codes: A Unified View based on Forney-style Factor Graphs
Quantum error-correction codes (QECCs) are a vital ingredient of quantum computation and communication systems. In that context it is highly desirable to design QECCs that can be r...
Pascal O. Vontobel
129
Voted
JGAA
2006
108views more  JGAA 2006»
15 years 5 months ago
Planar embeddability of the vertices of a graph using a fixed point set is NP-hard
Let G = (V, E) be a graph with n vertices and let P be a set of n points in the plane. We show that deciding whether there is a planar straight-line embedding of G such that the v...
Sergio Cabello
CIKM
2008
Springer
15 years 7 months ago
The query-flow graph: model and applications
Query logs record the queries and the actions of the users of search engines, and as such they contain valuable information about the interests, the preferences, and the behavior ...
Paolo Boldi, Francesco Bonchi, Carlos Castillo, De...
JGAA
2002
86views more  JGAA 2002»
15 years 4 months ago
Planar Graphs with Topological Constraints
We address in this paper the problem of constructing embeddings of planar graphs satisfying declarative, user-defined topological constraints. The constraints consist each of a cy...
Christoph Dornheim