Sciweavers

2657 search results - page 368 / 532
» On the complexity of hierarchical problem solving
Sort
View
CVPR
2007
IEEE
16 years 9 months ago
Optimal Dimensionality Discriminant Analysis and Its Application to Image Recognition
Dimensionality reduction is an important issue when facing high-dimensional data. For supervised dimensionality reduction, Linear Discriminant Analysis (LDA) is one of the most po...
Feiping Nie, Shiming Xiang, Yangqiu Song, Changshu...
ECCV
2004
Springer
16 years 8 months ago
Sparse Finite Elements for Geodesic Contours with Level-Sets
Level-set methods have been shown to be an effective way to solve optimisation problems that involve closed curves. They are well known for their capacity to deal with flexible top...
Martin Weber, Andrew Blake, Roberto Cipolla
SIGMOD
2005
ACM
144views Database» more  SIGMOD 2005»
16 years 7 months ago
Mining Periodic Patterns with Gap Requirement from Sequences
We study a problem of mining frequently occurring periodic patterns with a gap requirement from sequences. Given a character sequence S of length L and a pattern P of length l, we...
Minghua Zhang, Ben Kao, David Wai-Lok Cheung, Kevi...
TACAS
2009
Springer
136views Algorithms» more  TACAS 2009»
16 years 1 months ago
Path Feasibility Analysis for String-Manipulating Programs
We discuss the problem of path feasibility for programs manipulating strings using a collection of standard string library functions. We prove results on the complexity of this pro...
Nikolaj Bjørner, Nikolai Tillmann, Andrei V...
ICASSP
2009
IEEE
16 years 1 months ago
MIMO decoding based on stochastic reconstruction from multiple projections
Least squares (LS) fitting is one of the most fundamental techniques in science and engineering. It is used to estimate parameters from multiple noisy observations. In many probl...
Amir Leshem, Jacob Goldberger