Sciweavers

876 search results - page 86 / 176
» Complexity in geometric SINR
Sort
View
COMPGEOM
2011
ACM
13 years 1 months ago
An output-sensitive algorithm for persistent homology
In this paper, we present the first output-sensitive algorithm to compute the persistence diagram of a filtered simplicial complex. For any Γ > 0, it returns only those homo...
Chao Chen, Michael Kerber
MOBIHOC
2004
ACM
14 years 9 months ago
On greedy geographic routing algorithms in sensing-covered networks
Greedy geographic routing is attractive in wireless sensor networks due to its efficiency and scalability. However, greedy geographic routing may incur long routing paths or even ...
Guoliang Xing, Chenyang Lu, Robert Pless, Qingfeng...
COMPGEOM
2009
ACM
14 years 4 months ago
Coresets for polytope distance
Following recent work of Clarkson, we translate the coreset framework to the problems of finding the point closest to the origin inside a polytope, finding the shortest distance...
Bernd Gärtner, Martin Jaggi
NPIV
1998
ACM
108views Visualization» more  NPIV 1998»
14 years 2 months ago
Visualization for situation awareness
We explore techniques from visualization and computational geometry to make tactical information more intuitive to a military commander. To be successful, the commander must quick...
C. M. Hoffman, Y.-J. Kim, R. P. Winkler, J. D. Wal...
VISUALIZATION
1997
IEEE
14 years 2 months ago
Dynamic smooth subdivision surfaces for data visualization
Recursive subdivision schemes have been extensively used in computer graphics and scientific visualization for modeling smooth surfaces of arbitrary topology. Recursive subdivisi...
Chhandomay Mandal, Hong Qin, Baba C. Vemuri