Sciweavers

2031 search results - page 14 / 407
» On Tree-Constrained Matchings and Generalizations
Sort
View
ACCV
2010
Springer
14 years 11 months ago
Abstraction and Generalization of 3D structure for recognition in large intra-class variation
Humans have abstract models for object classes which helps recognize previously unseen instances, despite large intra-class variations. Also objects are grouped into classes based...
Gowri Somanath, Chandra Kambhamettu
TON
2010
192views more  TON 2010»
14 years 4 months ago
Delay analysis for wireless networks with single hop traffic and general interference constraints
We consider a class of wireless networks with general interference constraints on the set of links that can be served simultaneously at any given time. We restrict the traffic to b...
Gagan Raj Gupta, Ness B. Shroff
ICCV
2009
IEEE
14 years 7 months ago
Matching as a non-cooperative game
With this paper we offer a game-theoretic perspective for the all-pervasive matching problem in computer vision. Specifically, we formulate the matching problem as a (population) ...
Andrea Albarelli, Samuel Rota Bulò, Andrea ...
IPL
2006
139views more  IPL 2006»
14 years 9 months ago
An adjustable linear time parallel algorithm for maximum weight bipartite matching
We present a parallel algorithm for finding a maximum weight matching in general bipartite graphs with an adjustable time complexity of O(n ) using O(nmax(2,4+)) processing
Morteza Fayyazi, David R. Kaeli, Waleed Meleis
SGP
2007
15 years 1 days ago
Generalized surface flows for mesh processing
Geometric flows are ubiquitous in mesh processing. Curve and surface evolutions based on functional minimization have been used in the context of surface diffusion, denoising, sha...
Ilya Eckstein, Jean-Philippe Pons, Yiying Tong, C....