Sciweavers

220 search results - page 23 / 44
» Using Difference Reduction for Generic Proof Search
Sort
View
ICIP
2001
IEEE
14 years 9 months ago
On sparse signal representations
An elementary proof of a basic uncertainty principle concerning pairs of representations of ?? vectors in different orthonormal bases is provided. The result, slightly stronger th...
Michael Elad, Alfred M. Bruckstein
TIT
2002
94views more  TIT 2002»
13 years 7 months ago
A generalized uncertainty principle and sparse representation in pairs of bases
An elementary proof of a basic uncertainty principle concerning pairs of representations of vectors in different orthonormal bases is provided. The result, slightly stronger than s...
Michael Elad, Alfred M. Bruckstein
AI
2006
Springer
13 years 8 months ago
Cut-and-solve: An iterative search strategy for combinatorial optimization problems
Branch-and-bound and branch-and-cut use search trees to identify optimal solutions to combinatorial optimization problems. In this paper, we introduce an iterative search strategy...
Sharlee Climer, Weixiong Zhang
AIED
2007
Springer
14 years 2 months ago
Empowering researchers to detect interaction patterns in e-collaboration
This paper describes an approach to support practitioners in the analysis of computer-supported learning processes by utilizing logfiles of learners’ actions captured by the sys...
Andreas Harrer, Rakheli Hever, Sabrina Ziebarth
ECCV
2002
Springer
14 years 9 months ago
A Comparison of Search Strategies for Geometric Branch and Bound Algorithms
Over the last decade, a number of methods for geometric matching based on a branch-and-bound approach have been proposed. Such algorithms work by recursively subdividing transforma...
Thomas M. Breuel