Sciweavers

1941 search results - page 254 / 389
» On the Hardness of Approximate Reasoning
Sort
View
COMPGEOM
2006
ACM
16 years 10 days ago
Plane embeddings of planar graph metrics
Embedding metrics into constant-dimensional geometric spaces, such as the Euclidean plane, is relatively poorly understood. Motivated by applications in visualization, ad-hoc netw...
MohammadHossein Bateni, Mohammad Taghi Hajiaghayi,...
COMPGEOM
2006
ACM
16 years 10 days ago
Envelope surfaces
We construct a class of envelope surfaces in Rd , more precisely envelopes of balls. An envelope surface is a closed C1 (tangent continuous) manifold wrapping tightly around the u...
Nico Kruithof, Gert Vegter
SENSYS
2006
ACM
16 years 10 days ago
Target tracking with binary proximity sensors: fundamental limits, minimal descriptions, and algorithms
We explore fundamental performance limits of tracking a target in a two-dimensional field of binary proximity sensors, and design algorithms that attain those limits. In particul...
Nisheeth Shrivastava, Raghuraman Mudumbai, Upamany...
WIDM
2006
ACM
16 years 10 days ago
SRI: exploiting semantic information for effective query routing in a PDMS
The huge amount of data available from Internet information sources has focused much attention on the sharing of distributed information through Peer Data Management Systems (PDMS...
Federica Mandreoli, Riccardo Martoglia, Simona Sas...
MM
2005
ACM
215views Multimedia» more  MM 2005»
15 years 12 months ago
OpenVIDIA: parallel GPU computer vision
Graphics and vision are approximate inverses of each other: ordinarily Graphics Processing Units (GPUs) are used to convert “numbers into pictures” (i.e. computer graphics). I...
James Fung, Steve Mann