Sciweavers

1512 search results - page 55 / 303
» connection 2006
Sort
View
COMBINATORICS
2000
73views more  COMBINATORICS 2000»
14 years 9 months ago
Note on Gy. Elekes's Conjectures Concerning Unavoidable Patterns in Proper Colorings
A counterexample is presented to Gy. Elekes's conjecture concerning the existence of long 2-colored paths in properly colored graphs. A modified version of the conjecture is ...
Vera Rosta
CGF
2006
72views more  CGF 2006»
14 years 9 months ago
GEncode: Geometry-driven compression for General Meshes
Performances of actual mesh compression algorithms vary significantly depending on the type of model it encodes. These methods rely on prior assumptions on the mesh to be efficient...
Thomas Lewiner, Marcos Craizer, Hélio Lopes...
ICRA
2006
IEEE
131views Robotics» more  ICRA 2006»
15 years 3 months ago
A Practical Algorithm for Network Topology Inference
— When a network of robots or static sensors is emplaced in an environment, the spatial relationships between the sensing units must be inferred or computed for most key applicat...
Dimitri Marinakis, Gregory Dudek
FM
2006
Springer
124views Formal Methods» more  FM 2006»
15 years 1 months ago
Compositional Binding in Network Domains
This paper considers network services that bind identifiers in the course of delivering messages, and also persistent, point-to-point connections made in the context of such bindin...
Pamela Zave
APVIS
2006
14 years 11 months ago
Polygon labelling of minimum leader length
We study a variation of the boundary labelling problem, with floating sites (represented as polygons), labels of uniform size placed in fixed positions on the boundary of a rectan...
Michael A. Bekos, Michael Kaufmann, Katerina Potik...