2654 search results - page 129 / 531 » On Pairing Inversion Problems |
129
Voted
STACS
2001
Springer
15 years 9 months ago
2001
Springer
The stretch factor of a Euclidean graph is the maximum ratio of the distance in the graph between any two points and their Euclidean distance. Given a set S of n points in Rd, we ...
121
click to vote
ISMB
1997
15 years 6 months ago
1997
Anewheuristic algorithm is presented for mapping probes to locations along the genome,given noisy pairwise distance data as input. Themodel consideredis quite general: Theinput co...
147
Voted
ALMOB
2006
15 years 5 months ago
2006
The String Barcoding (SBC) problem, introduced by Rash and Gusfield (RECOMB, 2002), consists in finding a minimum set of substrings that can be used to distinguish between all mem...
173
click to vote
MOC
2011
14 years 12 months ago
2011
The simplest pair of spaces P1/P0 is made inf-sup stable for the mixed form of the Darcy equation. The key ingredient is enhance the finite element spaces inside a PetrovGalerkin ...
120
click to vote
EJWCN
2010
14 years 12 months ago
2010
Model checking (MC) is a formal verification technique which has known and still knows a resounding success in the computer science community. Realizing that the distributed power...