Sciweavers

2969 search results - page 240 / 594
» A space efficient algorithm for group structure computation
Sort
View
EDBT
2004
ACM
119views Database» more  EDBT 2004»
16 years 6 months ago
NNH: Improving Performance of Nearest-Neighbor Searches Using Histograms
Efficient search for nearest neighbors (NN) is a fundamental problem arising in a large variety of applications of vast practical interest. In this paper we propose a novel techniq...
Liang Jin, Nick Koudas, Chen Li
ICDE
2012
IEEE
343views Database» more  ICDE 2012»
13 years 9 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
CVPR
2009
IEEE
17 years 1 months ago
Discriminative Subvolume Search for Efficient Action Detection
Actions are spatio-temporal patterns which can be characterized by collections of spatio-temporal invariant features. Detection of actions is to find the re-occurrences (e.g. th...
Junsong Yuan (Northwestern University), Zicheng Li...
ICCV
2007
IEEE
16 years 8 months ago
Structure from Statistics - Unsupervised Activity Analysis using Suffix Trees
Models of activity structure for unconstrained environments are generally not available a priori. Recent representational approaches to this end are limited by their computational...
Raffay Hamid, Siddhartha Maddi, Aaron F. Bobick, I...
GECCO
2007
Springer
189views Optimization» more  GECCO 2007»
15 years 10 months ago
A genetic algorithm with exon shuffling crossover for hard bin packing problems
A novel evolutionary approach for the bin packing problem (BPP) is presented. A simple steady-state genetic algorithm is developed that produces results comparable to other approa...
Philipp Rohlfshagen, John A. Bullinaria