2125 search results - page 247 / 425 » On Graph Complexity |
122
Voted
VISUALIZATION
2000
IEEE
15 years 8 months ago
2000
IEEE
We present a new approach to surface reconstruction based on the Delaunay complex. First we give a simple and fast algorithm that picks locally a surface at each vertex. For that,...
136
Voted
PODC
2010
ACM
15 years 7 months ago
2010
ACM
We introduce Multi-Trials, a new technique for symmetry breaking for distributed algorithms and apply it to various problems in general graphs. For instance, we present three rand...
134
Voted
PSTV
1993
15 years 4 months ago
1993
We present a new algorithm that can be used for solving the model−checking problem for linear−time temporal logic. This algorithm can be viewed as the combination of two exist...
139
Voted
WEBDB
2005
Springer
15 years 9 months ago
2005
Springer
In recent years it has been argued that when XML encodings become complex, DOM trees are no longer adequate for query processing. Alternative representations of XML documents, suc...
147
Voted
CISS
2008
IEEE
15 years 10 months ago
2008
IEEE
— In this paper, we present a distributed algorithm for detecting redundancies in a sensor network with no location information. We demonstrate how, in the absence of localizatio...