Sciweavers

511 search results - page 70 / 103
» Approximate Selection Queries over Imprecise Data
Sort
View
ICRA
2009
IEEE
226views Robotics» more  ICRA 2009»
15 years 3 months ago
3D model selection from an internet database for robotic vision
Abstract-- We propose a new method for automatically accessing an internet database of 3D models that are searchable only by their user-annotated labels, for using them for vision ...
Ulrich Klank, Muhammad Zeeshan Zia, Michael Beetz
DMDW
2000
93views Management» more  DMDW 2000»
15 years 7 months ago
Storing auxiliary data for efficient maintenance and lineage tracing of complex views
As views in a data warehouse become more complex, the view maintenance process can become very complicated and potentially very inefficient. Storing auxiliary views in the warehou...
Yingwei Cui, Jennifer Widom
TSP
2008
115views more  TSP 2008»
15 years 6 months ago
Approximation Bounds for Semidefinite Relaxation of Max-Min-Fair Multicast Transmit Beamforming Problem
Consider a downlink multicast scenario where a base station equipped with multiple antennas wishes to simultaneously broadcast a number of signals to some given groups of users ove...
Tsung-Hui Chang, Zhi-Quan Luo, Chong-Yung Chi
SISAP
2008
IEEE
188views Data Mining» more  SISAP 2008»
16 years 13 days ago
High-Dimensional Similarity Retrieval Using Dimensional Choice
There are several pieces of information that can be utilized in order to improve the efficiency of similarity searches on high-dimensional data. The most commonly used information...
Dave Tahmoush, Hanan Samet
PVLDB
2008
116views more  PVLDB 2008»
15 years 5 months ago
Tighter estimation using bottom k sketches
Summaries of massive data sets support approximate query processing over the original data. A basic aggregate over a set of records is the weight of subpopulations specified as a ...
Edith Cohen, Haim Kaplan