Sciweavers

4850 search results - page 53 / 970
» Approximate Data Structures with Applications
Sort
View
STOC
2006
ACM
138views Algorithms» more  STOC 2006»
15 years 10 months ago
Searching dynamic point sets in spaces with bounded doubling dimension
We present a new data structure that facilitates approximate nearest neighbor searches on a dynamic set of points in a metric space that has a bounded doubling dimension. Our data...
Richard Cole, Lee-Ad Gottlieb
ICDE
2006
IEEE
201views Database» more  ICDE 2006»
15 years 11 months ago
Approximate Data Collection in Sensor Networks using Probabilistic Models
Wireless sensor networks are proving to be useful in a variety of settings. A core challenge in these networks is to minimize energy consumption. Prior database research has propo...
David Chu, Amol Deshpande, Joseph M. Hellerstein, ...
ISCAS
2008
IEEE
145views Hardware» more  ISCAS 2008»
15 years 4 months ago
Group learning using contrast NMF : Application to functional and structural MRI of schizophrenia
— Non-negative Matrix factorization (NMF) has increasingly been used as a tool in signal processing in the last couple of years. NMF, like independent component analysis (ICA) is...
Vamsi K. Potluru, Vince D. Calhoun
JMLR
2010
186views more  JMLR 2010»
14 years 4 months ago
Dimensionality Estimation, Manifold Learning and Function Approximation using Tensor Voting
We address instance-based learning from a perceptual organization standpoint and present methods for dimensionality estimation, manifold learning and function approximation. Under...
Philippos Mordohai, Gérard G. Medioni
CHI
2011
ACM
14 years 1 months ago
A spreadsheet-based user interface for managing plural relationships in structured data
A key feature of relational database applications is managing plural relationships—one-to-many and many-to-many— between entities. However, since it is often infeasible to ado...
Eirik Bakke, David R. Karger, Rob Miller