Sciweavers

2498 search results - page 163 / 500
» Data Structures with Unpredictable Timing
Sort
View
SODA
2001
ACM
108views Algorithms» more  SODA 2001»
14 years 11 months ago
Entropy-preserving cuttings and space-efficient planar point location
Point location is the problem of preprocessing a planar polygonal subdivision S into a data structure in order to determine efficiently the cell of the subdivision that contains a...
Sunil Arya, Theocharis Malamatos, David M. Mount
ISASSCI
2001
14 years 11 months ago
Data Mining Architectures - A Comparative Study
Data mining is the process of deriving knowledge from data. The architecture of a data mining system plays a significant role in the efficiency with which data is mined. It is pro...
Thomas Thomas, Sanjeev Jayakumar, B. Muthukumaran
FOCS
2008
IEEE
15 years 4 months ago
A Geometric Approach to Lower Bounds for Approximate Near-Neighbor Search and Partial Match
This work investigates a geometric approach to proving cell probe lower bounds for data structure problems. We consider the approximate nearest neighbor search problem on the Bool...
Rina Panigrahy, Kunal Talwar, Udi Wieder
ALT
2003
Springer
15 years 1 months ago
Efficient Learning of Ordered and Unordered Tree Patterns with Contractible Variables
Due to the rapid growth of tree structured data such as Web documents, efficient learning from tree structured data becomes more and more important. In order to represent structura...
Yusuke Suzuki, Takayoshi Shoudai, Satoshi Matsumot...
BSN
2009
IEEE
136views Sensor Networks» more  BSN 2009»
15 years 4 months ago
Comparison of Orientation Filter Algorithms for Realtime Wireless Inertial Posture Tracking
—Advances in the miniaturisation of inertial sensors have allowed the design of compact wireless inertial orientation trackers. Such devices require data fusion algorithms to pro...
A. D. Young