Sciweavers

446 search results - page 43 / 90
» Extremal Stable Graphs
Sort
View
INFOCOM
2009
IEEE
15 years 6 months ago
Lightweight Coloring and Desynchronization for Networks
—We study the distributed desynchronization problem for graphs with arbitrary topology. Motivated by the severe computational limitations of sensor networks, we present a randomi...
Arik Motskin, Tim Roughgarden, Primoz Skraba, Leon...
VRST
1997
ACM
15 years 4 months ago
Modeling and rendering of outdoor scenes for distributed virtual environments
Abstract. We present an approach for modeling and realtime rendering of outdoor scenes, for use in virtual reality applications such as flight simulators and multi-user virtual env...
Dieter Schmalstieg, Michael Gervautz
AAAI
1994
15 years 1 months ago
In Search of the Best Constraint Satisfaction Search
We present the results of an empirical study of several constraint satisfaction search algorithms and heuristics. Using a random problem generator that allows us to create instanc...
Daniel Frost, Rina Dechter
GC
2008
Springer
14 years 12 months ago
On 2-Detour Subgraphs of the Hypercube
A spanning subgraph H of a graph G is a 2-detour subgraph of G if for each x, y V (G), dH (x, y) dG(x, y) + 2. We prove a conjecture of Erdos, Hamburger, Pippert, and Weakley by ...
József Balogh, Alexandr V. Kostochka
OA
1989
237views Algorithms» more  OA 1989»
15 years 3 months ago
Which Triangulations Approximate the Complete Graph?
nce Abstract) 1 GAUTAM DAS - University of Wisconsin DEBORAH JOSEPH - University of Wisconsin Chew and Dobkin et. al. have shown that the Delaunay triangulation and its variants ar...
Gautam Das, Deborah Joseph