2127 search results - page 139 / 426 » Computing large matchings fast |
132
click to vote
IPMI
2005
Springer
16 years 4 months ago
2005
Springer
Abstract. We present a new method for computing an optimal deformation between two arbitrary surfaces embedded in Euclidean 3-dimensional space. Our main contribution is in buildin...
135
click to vote
ESWS
2007
Springer
15 years 10 months ago
2007
Springer
We investigate scalable algorithms for automated composition (WSC) of Semantic Web Services. Our notion of WSC is very general: the composition semantics includes background knowl...
135
click to vote
EMMCVPR
2005
Springer
15 years 9 months ago
2005
Springer
Abstract. In this paper, we present a novel successive relaxation linear programming scheme for solving the important class of consistent labeling problems for which an L1 metric i...
167
click to vote
TOG
2008
15 years 2 months ago
2008
Although mature technologies exist for acquiring images, geometry, and normals of small objects, they remain cumbersome and time-consuming for non-experts to employ on a large sca...
129
click to vote
EWCBR
2006
Springer
15 years 7 months ago
2006
Springer
Case Retrieval Networks (CRNs) facilitate flexible and efficient retrieval in Case-Based Reasoning (CBR) systems. While CRNs scale up well to handle large numbers of cases in the c...