1632 search results - page 31 / 327 » Sublinear Time Algorithms for Metric Space Problems |
113
click to vote
ISCIS
2005
Springer
15 years 8 months ago
2005
Springer
Abstract. We investigate the problem of enumerating schedules, consisting of course-section assignments, in increasing order of the number of conflicts they contain. We define th...
106
click to vote
ICRA
2005
IEEE
15 years 9 months ago
2005
IEEE
— This paper presents a metric-based matching algorithm to estimate the robot planar displacement by matching dense two-dimensional range scans. The contribution is a geometric d...
114
click to vote
IPPS
2003
IEEE
15 years 8 months ago
2003
IEEE
Given two strings and of lengths Ñ and Ò, respectively, the all-substrings longest common subsequence (ALCS) problem obtains the lengths of the subsequences common to and any su...
139
click to vote
CVPR
2003
IEEE
16 years 5 months ago
2003
IEEE
Graph matching is an important component in many object recognition algorithms. Although most graph matching algorithms seek a one-to-one correspondence between nodes, it is often...
129
click to vote
COLT
2010
Springer
15 years 1 months ago
2010
Springer
Recent advances in large-margin classification of data residing in general metric spaces (rather than Hilbert spaces) enable classification under various natural metrics, such as ...