Sciweavers

4679 search results - page 399 / 936
» Modeling When Connections Are the Problem
Sort
View
SPIRE
2005
Springer
16 years 8 days ago
Using the k-Nearest Neighbor Graph for Proximity Searching in Metric Spaces
Proximity searching consists in retrieving from a database, objects that are close to a query. For this type of searching problem, the most general model is the metric space, where...
Rodrigo Paredes, Edgar Chávez
COMPGEOM
2004
ACM
16 years 6 days ago
Deformable spanners and applications
For a set S of points in Rd, an s-spanner is a graph on S such that any pair of points is connected via some path in the spanner whose total length is at most s times the Euclidea...
Jie Gao, Leonidas J. Guibas, An Nguyen
STOC
1997
ACM
76views Algorithms» more  STOC 1997»
15 years 11 months ago
Exploring Unknown Environments
We consider exploration problems where a robot has to construct a complete map of an unknown environment. We assume that the environment is modeled by a directed, strongly connecte...
Susanne Albers, Monika Rauch Henzinger
GRAPHICSINTERFACE
2007
15 years 8 months ago
Constrained planar remeshing for architecture
Material limitations and fabrication costs generally run at odds with the creativity of architectural design, producing a wealth of challenging computational geometry problems. We...
Barbara Cutler, Emily Whiting
174
Voted
JSAC
2006
99views more  JSAC 2006»
15 years 6 months ago
Incentives for large peer-to-peer systems
We consider problems of provisioning an excludable public good amongst n potential members of a peer-to-peer system who are able to communicate information about their private pre...
Costas Courcoubetis, Richard R. Weber