Sciweavers

2312 search results - page 386 / 463
» The complexity of estimating min-entropy
Sort
View
ICANN
2001
Springer
15 years 2 months ago
Independent Variable Group Analysis
Humans tend to group together related properties in order to understand complex phenomena. When modeling large problems with limited representational resources, it is important to...
Krista Lagus, Esa Alhoniemi, Harri Valpola
ICDT
2001
ACM
116views Database» more  ICDT 2001»
15 years 2 months ago
On Optimizing Nearest Neighbor Queries in High-Dimensional Data Spaces
Abstract. Nearest-neighbor queries in high-dimensional space are of high importance in various applications, especially in content-based indexing of multimedia data. For an optimiz...
Stefan Berchtold, Christian Böhm, Daniel A. K...
ISSAC
2001
Springer
123views Mathematics» more  ISSAC 2001»
15 years 2 months ago
A probabilistic algorithm to test local algebraic observability in polynomial time
The following questions are often encountered in system and control theory. Given an algebraic model of a physical process, which variables can be, in theory, deduced from the inp...
Alexandre Sedoglavic
SCALESPACE
2001
Springer
15 years 2 months ago
Down-Scaling for Better Transform Compression
Abstract. The most popular lossy image compression method used on the Internet is the JPEG standard. JPEG’s good compression performance and low computational and memory complexi...
Alfred M. Bruckstein, Michael Elad, Ron Kimmel
CVPR
2000
IEEE
15 years 2 months ago
A Combined Feature-Texture Similarity Measure for Face Alignment under
We formulate face alignment as a model-based parameter estimation problem in this paper. First, we work within a framework that combines two separate subspace models to r epresent...
Lixin Fan, Kah Kay Sung