10608 search results - page 661 / 2122 » Complexity of O'Hara's Algorithm |
155
click to vote
DCC
2004
IEEE
16 years 6 months ago
2004
IEEE
We extend Ukkonen's online suffix tree construction algorithm to support frequency queries, by adding count fields to the internal nodes of the tree, as suggested in [8]. Thi...
212
Voted
ICCAD
2003
IEEE
16 years 4 months ago
2003
IEEE
Abstract: In this paper, we present an interprocessor communication-aware task scheduling algorithm applicable to a multiprocessor system executing an application with dependent ta...
160
click to vote
LATA
2010
Springer
16 years 2 months ago
2010
Springer
The smallest grammar problem - namely, finding a smallest context-free grammar that generates exactly one sequence - is of practical and theoretical importance in fields such as ...
186
click to vote
TACAS
2009
Springer
16 years 2 months ago
2009
Springer
CEDAR (Counter Example Driven Antichain Refinement) is a new symbolic algorithm for computing weakest strategies for safety games of imperfect information. The algorithm computes ...
194
click to vote
ICRA
2009
IEEE
16 years 1 months ago
2009
IEEE
— In mobile robotics, the segmentation of range data is an important prerequisite to object recognition and environment understanding. This paper presents an algorithm for realti...