2949 search results - page 92 / 590 » Universal Sparse Modeling |
117
click to vote
DAGM
2006
Springer
15 years 4 months ago
2006
Springer
Abstract. We present a novel model for object recognition and detection that follows the widely adopted assumption that objects in images can be represented as a set of loosely cou...
GLOBECOM
2009
IEEE
14 years 10 months ago
2009
IEEE
In this paper we provide a mathematical ILP model for the Regeneration Placement Problem (RPP) which minimizes the total number of regeneration nodes allocated in a translucent opt...
109
click to vote
SIAMCOMP
1998
15 years 10 days ago
1998
Random binary search trees, b-ary search trees, median-of-(2k+1) trees, quadtrees, simplex trees, tries, and digital search trees are special cases of random split trees. For these...
68
Voted
ICIP
2007
IEEE
16 years 2 months ago
2007
IEEE
Finding the sparsest approximation of an image as a sum of basis functions drawn from a redundant dictionary is an NPhard problem. In the case of a dictionary whose elements form ...
108
Voted
IPPS
1999
IEEE
15 years 5 months ago
1999
IEEE
Many numerical solutions of large scale simulation models require finer discretizations in some regions of the computational grid. When this region is not known in advance, adapti...