Sciweavers

2312 search results - page 260 / 463
» On the Dimensionality of Face Space
Sort
View
CVPR
2007
IEEE
16 years 8 months ago
Approximate Nearest Subspace Search with Applications to Pattern Recognition
Linear and affine subspaces are commonly used to describe appearance of objects under different lighting, viewpoint, articulation, and identity. A natural problem arising from the...
Ronen Basri, Tal Hassner, Lihi Zelnik-Manor
KDD
2003
ACM
109views Data Mining» more  KDD 2003»
16 years 7 months ago
Generative model-based clustering of directional data
High dimensional directional data is becoming increasingly important in contemporary applications such as analysis of text and gene-expression data. A natural model for multivaria...
Arindam Banerjee, Inderjit S. Dhillon, Joydeep Gho...
STOC
2001
ACM
122views Algorithms» more  STOC 2001»
16 years 6 months ago
One-dimensional quantum walks
In this paper we analyze the behavior of quantum random walks. In particular we present several new results for the absorption probabilities in systems with both one and two absor...
Andris Ambainis, Eric Bach, Ashwin Nayak, Ashvin V...
VLDB
2006
ACM
190views Database» more  VLDB 2006»
16 years 6 months ago
Online summarization of dynamic time series data
Managing large-scale time series databases has attracted significant attention in the database community recently. Related fundamental problems such as dimensionality reduction, tr...
Ümit Y. Ogras, Hakan Ferhatosmanoglu
SDM
2009
SIAM
176views Data Mining» more  SDM 2009»
16 years 3 months ago
Constraint-Based Subspace Clustering.
In high dimensional data, the general performance of traditional clustering algorithms decreases. This is partly because the similarity criterion used by these algorithms becomes ...
Élisa Fromont, Adriana Prado, Céline...