Sciweavers

22 search results - page 3 / 5
» The cell probe complexity of dynamic range counting
Sort
View
CORR
2010
Springer
249views Education» more  CORR 2010»
13 years 8 months ago
Lower Bounds on Near Neighbor Search via Metric Expansion
In this paper we show how the complexity of performing nearest neighbor (NNS) search on a metric space is related to the expansion of the metric space. Given a metric space we loo...
Rina Panigrahy, Kunal Talwar, Udi Wieder
ICDE
1999
IEEE
89views Database» more  ICDE 1999»
14 years 10 months ago
Relative Prefix Sums: An Efficient Approach for Querying Dynamic OLAP Data Cubes
Range sum queries on data cubes are a powerful tool for analysis. A range sum query applies an aggregation operation (e.g., SUM) over all selected cells in a data cube, where the ...
Steven Geffner, Divyakant Agrawal, Amr El Abbadi, ...
BMCBI
2006
174views more  BMCBI 2006»
13 years 8 months ago
CARAT: A novel method for allelic detection of DNA copy number changes using high density oligonucleotide arrays
Background: DNA copy number alterations are one of the main characteristics of the cancer cell karyotype and can contribute to the complex phenotype of these cells. These alterati...
Jing Huang, Wen Wei, Joyce Chen, Jane Zhang, Guoyi...
HAPTICS
2007
IEEE
14 years 2 months ago
Shaping Event-Based Haptic Transients Via an Improved Understanding of Real Contact Dynamics
Haptic interactions with stiff virtual surfaces feel more realistic when a short-duration transient is added to the spring force at contact. But how should this event-based transi...
Jonathan Fiene, Katherine J. Kuchenbecker
FOCS
2008
IEEE
14 years 3 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