Sciweavers

19 search results - page 3 / 4
» Interval Sorting
Sort
View
ESA
2000
Springer
104views Algorithms» more  ESA 2000»
13 years 11 months ago
Efficient Algorithms for Centers and Medians in Interval and Circular-Arc Graphs
The p-center problem is to locate p facilities on a network so as to minimize the largest distance from a demand point to its nearest facility. The p-median problem is to locate p ...
Sergei Bespamyatnikh, Binay K. Bhattacharya, J. Ma...
RECOMB
2008
Springer
14 years 7 months ago
Perfect DCJ Rearrangement
We study the problem of transforming a multichromosomal genome into another using Double-Cut-and-Join (DCJ) operations. We introduce the notion of DCJ scenario that does not break ...
Sèverine Bérard, Annie Chateau, Cedr...
CCCG
2008
13 years 8 months ago
Competitive Search for Longest Empty Intervals
A problem arising in statistical data analysis and pattern recognition is to find a longest interval free of data points, given a set of data points in the unit interval. We use t...
Peter Damaschke
CIE
2005
Springer
13 years 9 months ago
Shrad: A Language for Sequential Real Number Computation
Since Di Gianantonio [1993] introduced his semantics for exact real omputation, there has always been a struggle to maintain data abstraction and efficiency as much as possible. T...
Amin Farjudian
ESA
2006
Springer
92views Algorithms» more  ESA 2006»
13 years 11 months ago
Out-of-Order Event Processing in Kinetic Data Structures
We study the problem of designing kinetic data structures (KDS's for short) when event times cannot be computed exactly and events may be processed in a wrong order. In tradi...
Mohammad Ali Abam, Pankaj K. Agarwal, Mark de Berg...