Sciweavers

357 search results - page 25 / 72
» Fast Hypergraph Partition
Sort
View
ICCV
2007
IEEE
14 years 9 months ago
Fast Pixel/Part Selection with Sparse Eigenvectors
We extend the "Sparse LDA" algorithm of [7] with new sparsity bounds on 2-class separability and efficient partitioned matrix inverse techniques leading to 1000-fold spe...
Bernard Moghaddam, Yair Weiss, Shai Avidan
ESANN
2004
13 years 9 months ago
Fast semi-automatic segmentation algorithm for Self-Organizing Maps
Self-Organizing Maps (SOM) are very powerful tools for data mining, in particular for visualizing the distribution of the data in very highdimensional data sets. Moreover, the 2D m...
David Opolon, Fabien Moutarde
EDBT
2011
ACM
281views Database» more  EDBT 2011»
12 years 11 months ago
Fast and accurate computation of equi-depth histograms over data streams
Equi-depth histograms represent a fundamental synopsis widely used in both database and data stream applications, as they provide the cornerstone of many techniques such as query ...
Hamid Mousavi, Carlo Zaniolo
ICTAI
2006
IEEE
14 years 1 months ago
Learning to Predict Salient Regions from Disjoint and Skewed Training Sets
We present an ensemble learning approach that achieves accurate predictions from arbitrarily partitioned data. The partitions come from the distributed processing requirements of ...
Larry Shoemaker, Robert E. Banfield, Lawrence O. H...
DAMON
2006
Springer
13 years 11 months ago
Architecture-conscious hashing
Hashing is one of the fundamental techniques used to implement query processing operators such as grouping, aggregation and join. This paper studies the interaction between modern...
Marcin Zukowski, Sándor Héman, Peter...