974 search results - page 119 / 195 » pairing 2010 |
CVPR
2010
IEEE
14 years 6 months ago
2010
IEEE
We present an automatic method that establishes 3D correspondence between isometric shapes. Our goal is to find an optimal correspondence between two given (nearly) isometric sha...
WSDM
2010
ACM
14 years 7 months ago
2010
ACM
We study the fundamental problem of computing distances between nodes in large graphs such as the web graph and social networks. Our objective is to be able to answer distance que...
SODA
2010
ACM
14 years 7 months ago
2010
ACM
We consider the following well-known problem, which is called the edge-disjoint paths problem. Input: A graph G with n vertices and m edges, k pairs of vertices (s1, t1), (s2, t2)...
SOFSEM
2010
Springer
14 years 7 months ago
2010
Springer
Abstract. This article introduces KWQL, spoken “quickel”, a rulebased query language for a semantic wiki based on the label-keyword query paradigm. KWQL allows for rich combine...
SOFSEM
2010
Springer
14 years 7 months ago
2010
Springer
An arc-annotated string is a string of characters, called bases, augmented with a set of pairs, called arcs, each connecting two bases. Given arc-annotated strings P and Q the arc-...