Sciweavers

7150 search results - page 1294 / 1430
» An Approximation Algorithm for Approximation Rank
Sort
View
SIGGRAPH
1999
ACM
15 years 10 months ago
Real-Time Acoustic Modeling for Distributed Virtual Environments
Realistic acoustic modeling is essential for spatializing sound in distributed virtual environments where multiple networked users move around and interact visually and aurally in...
Thomas A. Funkhouser, Patrick Min, Ingrid Carlbom
FOCS
2004
IEEE
15 years 10 months ago
Triangulation and Embedding Using Small Sets of Beacons
Concurrent with recent theoretical interest in the problem of metric embedding, a growing body of research in the networking community has studied the distance matrix defined by n...
Jon M. Kleinberg, Aleksandrs Slivkins, Tom Wexler
ESA
2006
Springer
140views Algorithms» more  ESA 2006»
15 years 10 months ago
Latency Constrained Aggregation in Sensor Networks
A sensor network consists of sensing devices which may exchange data through wireless communication. A particular feature of sensor networks is that they are highly energy constrai...
Luca Becchetti, Peter Korteweg, Alberto Marchetti-...
COMPGEOM
2008
ACM
15 years 8 months ago
Robust construction of the three-dimensional flow complex
The Delaunay triangulation and its dual the Voronoi diagram are ubiquitous geometric complexes. From a topological standpoint, the connection has recently been made between these ...
Frédéric Cazals, Aditya G. Parameswa...
CC
2007
Springer
121views System Software» more  CC 2007»
15 years 6 months ago
If NP Languages are Hard on the Worst-Case, Then it is Easy to Find Their Hard Instances
We prove that if NP ⊆ BPP, i.e., if SAT is worst-case hard, then for every probabilistic polynomial-time algorithm trying to decide SAT, there exists some polynomially samplable ...
Dan Gutfreund, Ronen Shaltiel, Amnon Ta-Shma
« Prev « First page 1294 / 1430 Last » Next »