Sciweavers

1132 search results - page 188 / 227
» Upper and lower Ramsey bounds in bounded arithmetic
Sort
View
SWAT
2004
Springer
98views Algorithms» more  SWAT 2004»
15 years 11 months ago
Tight Approximability Results for Test Set Problems in Bioinformatics
In this paper, we investigate the test set problem and its variations that appear in a variety of applications. In general, we are given a universe of objects to be “distinguish...
Piotr Berman, Bhaskar DasGupta, Ming-Yang Kao
CIAC
2010
Springer
252views Algorithms» more  CIAC 2010»
15 years 11 months ago
On the Number of Higher Order Delaunay Triangulations
Higher order Delaunay triangulations are a generalization of the Delaunay triangulation which provides a class of well-shaped triangulations, over which extra criteria can be optim...
Dieter Mitsche, Maria Saumell, Rodrigo I. Silveira
IWQOS
2001
Springer
15 years 10 months ago
QoS-Aware Adaptive Services in Mobile Ad-Hoc Networks
Ad-hoc wireless networks consist of mobile nodes interconnected by multi-hop wireless paths. Unlike conventional wireless networks, ad-hoc networks have no fixed network infrastru...
Baochun Li
RTCSA
1999
IEEE
15 years 10 months ago
Incorporating Error Recovery into the Imprecise Computation Model
In this paper; we describe optimal algorithmsfor incorporating error recovery in the imprecise computation model. In that model eack task compriser a mandatory and an optional par...
Hakan Aydin, Rami G. Melhem, Daniel Mossé
CIKM
2006
Springer
15 years 10 months ago
Distributed spatio-temporal similarity search
In this paper we introduce the distributed spatio-temporal similarity search problem: given a query trajectory Q, we want to find the trajectories that follow a motion similar to ...
Demetrios Zeinalipour-Yazti, Song Lin, Dimitrios G...