244 search results - page 35 / 49 » Generalized RANSAC Framework for Relaxed Correspondence Prob... |
CORR
2011
Springer
13 years 2 months ago
2011
Springer
Abstract. Consider a weighted and undirected graph, possibly with self-loops, and its corresponding Laplacian matrix, possibly augmented with additional diagonal elements correspon...
DATAMINE
2006
13 years 7 months ago
2006
Clustering methods for data-mining problems must be extremely scalable. In addition, several data mining applications demand that the clusters obtained be balanced, i.e., be of ap...
CIKM
2005
Springer
14 years 1 months ago
2005
Springer
A framework for describing semantic relationships among nodes in XML documents is presented. In contrast to earlier work, the XML documents may have ID references (i.e., they corr...
ECMDAFA
2006
Springer
13 years 11 months ago
2006
Springer
Abstract. Design patterns are templates of general solutions to commonlyoccurring problems in the analysis and design of software systems. In mature development processes, engineer...
CVPR
2009
IEEE
15 years 2 months ago
2009
IEEE
Convex and continuous energy formulations for low level
vision problems enable efficient search procedures for the
corresponding globally optimal solutions. In this work we
exte...