13987 search results - page 518 / 2798 » The Two Guards Problem |
197
click to vote
SPIRE
2005
Springer
16 years 18 days ago
2005
Springer
We introduce the notion of conservative edit distance and mapping between two RNA stem-loops. We show that unlike the general edit distance between RNA secondary structures, the co...
177
click to vote
SSS
2005
Springer
16 years 18 days ago
2005
Springer
Abstract. This paper considers message-driven self-stabilizing implementations of unreliable failure detectors. We show that it is impossible to give a deterministic implementation...
163
click to vote
WAIM
2005
Springer
16 years 17 days ago
2005
Springer
Driven by many real applications, in this paper we study the problem of similarity search with implicit object features; that is, the features of each object are not pre-computed/e...
146
click to vote
WIA
2005
Springer
16 years 17 days ago
2005
Springer
The complexity of various membership problems for tree automata on compressed trees is analyzed. Two compressed representations are considered: dags, which allow to share identical...
171
click to vote
ESA
2004
Springer
16 years 15 days ago
2004
Springer
We show the first o(n2 ) algorithm for coloring vertices of trianglefree planar graphs using three colors. The time complexity of the algorithm is O(n log n). Our approach can be ...