Sciweavers

679 search results - page 109 / 136
» Scaling Clustering Algorithms to Large Databases
Sort
View
VLDB
1998
ACM
105views Database» more  VLDB 1998»
14 years 21 days 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...
ICDE
2012
IEEE
343views Database» more  ICDE 2012»
11 years 11 months ago
Bi-level Locality Sensitive Hashing for k-Nearest Neighbor Computation
We present a new Bi-level LSH algorithm to perform approximate k-nearest neighbor search in high dimensional spaces. Our formulation is based on a two-level scheme. In the first ...
Jia Pan, Dinesh Manocha
AMR
2008
Springer
248views Multimedia» more  AMR 2008»
13 years 10 months ago
Mobile Museum Guide Based on Fast SIFT Recognition
Abstract. This article explores the feasibility of a market-ready, mobile pattern recognition system based on the latest findings in the field of object recognition and currently a...
Boris Ruf, Effrosini Kokiopoulou, Marcin Detynieck...
KDD
2010
ACM
300views Data Mining» more  KDD 2010»
14 years 11 days ago
Mining top-k frequent items in a data stream with flexible sliding windows
We study the problem of finding the k most frequent items in a stream of items for the recently proposed max-frequency measure. Based on the properties of an item, the maxfrequen...
Hoang Thanh Lam, Toon Calders
ECCV
2000
Springer
14 years 10 months ago
Learning to Recognize 3D Objects with SNoW
This paper describes a novel view-based learning algorithm for 3D object recognition from 2D images using a network of linear units. The SNoW learning architecture is a sparse netw...
Ming-Hsuan Yang, Dan Roth, Narendra Ahuja