Sciweavers

5169 search results - page 168 / 1034
» Locality approximation using time
Sort
View
FOCS
2008
IEEE
15 years 11 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
163
Voted
DCOSS
2006
Springer
15 years 8 months ago
Approximation Algorithms for Power-Aware Scheduling of Wireless Sensor Networks with Rate and Duty-Cycle Constraints
We develop algorithms for finding the minimum energy transmission schedule for duty-cycle and rate constrained wireless sensor nodes transmitting over an interference channel. Sinc...
Rajgopal Kannan, Shuangqing Wei
168
Voted
ECCV
2010
Springer
15 years 9 months ago
Efficient Highly Over-Complete Sparse Coding using a Mixture Model
Sparse coding of sensory data has recently attracted notable attention in research of learning useful features from the unlabeled data. Empirical studies show that mapping the data...
CG
2004
Springer
15 years 4 months ago
Point cloud surfaces using geometric proximity graphs
We present a new definition of an implicit surface over a noisy point cloud, based on the weighted least squares approach. It can be evaluated very fast, but artifacts are signifi...
Jan Klein, Gabriel Zachmann
CSDA
2006
103views more  CSDA 2006»
15 years 5 months ago
LASS: a tool for the local analysis of self-similarity
The Hurst parameter H characterizes the degree of long-range dependence (and asymptotic selfsimilarity) in stationary time series. Many methods have been developed for the estimat...
Stilian Stoev, Murad S. Taqqu, Cheolwoo Park, Geor...