2654 search results - page 123 / 531 » On Pairing Inversion Problems |
140
click to vote
WAOA
2005
Springer
15 years 10 months ago
2005
Springer
Let T = (V, E) be an undirected tree, in which each edge is associated with a non-negative cost, and let {s1, t1}, . . . , {sk, tk} be a collection of k distinct pairs of vertices...
137
click to vote
ISAAC
2004
Springer
15 years 10 months ago
2004
Springer
String comparison is a fundamental problem in computer science, with applications in areas such as computational biology, text processing or compression. In this paper we address t...
118
Voted
ESA
2003
Springer
15 years 10 months ago
2003
Springer
We address a fundamental problem arising from analysis of biomolecular sequences. The input consists of two numbers wmin and wmax and a sequence S of n number pairs (ai, wi) with ...
129
Voted
CIAC
2000
Springer
15 years 9 months ago
2000
Springer
We consideralgorithms for a simple one-dimensionalpoint placement problem: given N points on a line, and noisy measurements of the distances between many pairs of them, estimate th...
172
click to vote
IJCGA
2010
15 years 3 months ago
2010
This paper is concerned with on-line problems where a mobile robot of size D has to achieve a task in an unknown planar environment whose geometry is acquired by the robot during ...