Sciweavers

1709 search results - page 277 / 342
» Comparing the Performance of Database Selection Algorithms
Sort
View
153
Voted
BMCBI
2008
129views more  BMCBI 2008»
15 years 5 months ago
A unified approach to false discovery rate estimation
Background: False discovery rate (FDR) methods play an important role in analyzing highdimensional data. There are two types of FDR, tail area-based FDR and local FDR, as well as ...
Korbinian Strimmer
CVPR
2007
IEEE
16 years 6 months ago
Segmenting Motions of Different Types by Unsupervised Manifold Clustering
We propose a novel algorithm for segmenting multiple motions of different types from point correspondences in multiple affine or perspective views. Since point trajectories associ...
Alvina Goh, René Vidal
213
Voted
VLDB
1999
ACM
224views Database» more  VLDB 1999»
15 years 9 months ago
Optimal Grid-Clustering: Towards Breaking the Curse of Dimensionality in High-Dimensional Clustering
Many applications require the clustering of large amounts of high-dimensional data. Most clustering algorithms, however, do not work e ectively and e ciently in highdimensional sp...
Alexander Hinneburg, Daniel A. Keim
EDBT
2004
ACM
174views Database» more  EDBT 2004»
16 years 5 months ago
Processing Data-Stream Join Aggregates Using Skimmed Sketches
There is a growing interest in on-line algorithms for analyzing and querying data streams, that examine each stream element only once and have at their disposal, only a limited amo...
Sumit Ganguly, Minos N. Garofalakis, Rajeev Rastog...
IVC
2007
173views more  IVC 2007»
15 years 4 months ago
Outdoor recognition at a distance by fusing gait and face
We explore the possibility of using both face and gait in enhancing human recognition at a distance performance in outdoor conditions. Although the individual performance of gait ...
Zongyi Liu, Sudeep Sarkar