Sciweavers

4137 search results - page 532 / 828
» On the number of matchings of a tree
Sort
View
CGF
2006
177views more  CGF 2006»
15 years 6 months ago
Direct (Re)Meshing for Efficient Surface Processing
We propose a novel surface remeshing algorithm. While many remeshing algorithms are based on global parametrization or local mesh optimization, our algorithm is closely related to...
John M. Schreiner, Carlos Eduardo Scheidegger, Sha...
IJCV
2008
241views more  IJCV 2008»
15 years 6 months ago
Object Class Recognition and Localization Using Sparse Features with Limited Receptive Fields
We investigate the role of sparsity and localized features in a biologically-inspired model of visual object classification. As in the model of Serre, Wolf, and Poggio, we first a...
Jim Mutch, David G. Lowe
IJCV
2006
146views more  IJCV 2006»
15 years 6 months ago
An A Contrario Decision Method for Shape Element Recognition
: Shape recognition is the field of computer vision which addresses the problem of finding out whether a query shape lies or not in a shape database, up to a certain invariance. Mo...
Pablo Musé, Frédéric Sur, Fr&...
206
Voted
CORR
2007
Springer
183views Education» more  CORR 2007»
15 years 6 months ago
Compressed Sensing and Redundant Dictionaries
This article extends the concept of compressed sensing to signals that are not sparse in an orthonormal basis but rather in a redundant dictionary. It is shown that a matrix, whic...
Holger Rauhut, Karin Schnass, Pierre Vandergheynst
JPDC
2006
92views more  JPDC 2006»
15 years 6 months ago
A tight bound on remote reference time complexity of mutual exclusion in the read-modify-write model
In distributed shared memory multiprocessors, remote memory references generate processor-to-memory traffic, which may result in a bottleneck. It is therefore important to design ...
Sheng-Hsiung Chen, Ting-Lu Huang