2354 search results - page 211 / 471 » Radio number for trees |
197
click to vote
COCOON
1999
Springer
15 years 11 months ago
1999
Springer
We present results related to satisfying shortest path queries on a planar graph stored in external memory. Let N denote the number of vertices in the graph and let sort(N) denote...
184
click to vote
CORR
2011
Springer
15 years 1 months ago
2011
Springer
Compressive sensing (CS) exploits the sparsity present in many common signals to reduce the number of measurements needed for digital acquisition. With this reduction would come, ...
158
click to vote
VRCAI
2006
ACM
16 years 16 days ago
2006
ACM
We present novel algorithms for updating bounding volume hierarchies of objects undergoing arbitrary deformations. Therefore, we introduce two new data structures, the kinetic AAB...
147
click to vote
ICDM
2003
IEEE
15 years 12 months ago
2003
IEEE
We propose a novel clustering algorithm that is similar in spirit to classification trees. The data is recursively split using a criterion that applies a discrete curve evolution...
157
click to vote
GLOBECOM
2009
IEEE
16 years 1 months ago
2009
IEEE
— In this paper, we study the anonymous cardinality estimation problem in radio frequency identification (RFID) systems. To preserve privacy and anonymity, each tag only transmi...