Sciweavers

627 search results - page 74 / 126
» Privacy-Preserving k-NN for Small and Large Data Sets
Sort
View
STOC
2001
ACM
134views Algorithms» more  STOC 2001»
15 years 11 months ago
Data-streams and histograms
Histograms are typically used to approximate data distributions. Histograms and related synopsis structures have been successful in a wide variety of popular database applications...
Sudipto Guha, Nick Koudas, Kyuseok Shim
EDBT
2008
ACM
120views Database» more  EDBT 2008»
15 years 11 months ago
Flint: Google-basing the Web
Several Web sites deliver a large number of pages, each publishing data about one instance of some real world entity, such as an athlete, a stock quote, a book. Even though it is ...
Lorenzo Blanco, Valter Crescenzi, Paolo Merialdo, ...
VLDB
1998
ACM
105views Database» more  VLDB 1998»
15 years 3 months ago
Computing Iceberg Queries Efficiently
Many applications compute aggregate functions over an attribute (or set of attributes) to find aggregate values above some specified threshold. We call such queries iceberg querie...
Min Fang, Narayanan Shivakumar, Hector Garcia-Moli...
JGTOOLS
2008
126views more  JGTOOLS 2008»
14 years 11 months ago
Simple Empty-Space Removal for Interactive Volume Rendering
Interactive volume rendering methods such as texture-based slicing techniques and ray-casting have been well developed in recent years. The rendering performance is generally restr...
Vincent Vidal 0002, Xing Mei, Philippe Decaudin
ECCV
2008
Springer
16 years 1 months ago
Face Alignment Via Component-Based Discriminative Search
In this paper, we propose a component-based discriminative approach for face alignment without requiring initialization1 . Unlike many approaches which locally optimize in a small ...
Lin Liang, Rong Xiao, Fang Wen, Jian Sun