3471 search results - page 539 / 695 » Obstacle Numbers of Graphs |
180
click to vote
SPAA
2009
ACM
16 years 1 months ago
2009
ACM
We consider bit communication complexity of binary consensus in synchronous message passing systems with processes prone to crashes. A distributed algorithm is locally scalable wh...
188
click to vote
CORR
2010
Springer
15 years 1 months ago
2010
Springer
: In this paper, inspired by the work of Megiddo on the formation of preferences and strategic analysis, we consider an early market model studied in the field of economic theory, ...
178
click to vote
PODC
2004
ACM
15 years 11 months ago
2004
ACM
We analyze the properties of Small-World networks, where links are much more likely to connect “neighbor nodes” than distant nodes. In particular, our analysis provides new re...
159
click to vote
SODA
1992
ACM
15 years 7 months ago
1992
ACM
Let P be a property of undirected graphs. We consider the following problem: given a graph G that has property P, nd a minimal spanning subgraph of G with property P. We describe ...
185
click to vote
CVPR
2003
IEEE
16 years 8 months ago
2003
IEEE
We are building a system that can automatically acquire 3D range scans and 2D images to build geometrically and photometrically correct 3D models of urban environments. A major bo...