216 search results - page 27 / 44 » Fast Optimal Algorithms for Computing All the Repeats in a S... |
ESOP
1999
Springer
14 years 27 days ago
1999
Springer
Abstract. Dynamicprogramming is an importantalgorithm design technique. It is used for solving problems whose solutions involve recursively solving subproblems that share subsubpro...
DC
2010
13 years 8 months ago
2010
We present efficient algorithms for computing very sparse low distortion spanners in distributed networks and prove some non-trivial lower bounds on the tradeoff between time, spar...
SIGMOD
2001
ACM
14 years 8 months ago
2001
ACM
Materialized views can provide massive improvements in query processing time, especially for aggregation queries over large tables. To realize this potential, the query optimizer ...
ICDE
2000
IEEE
14 years 10 months ago
2000
IEEE
In information-integration systems, sources may have diverse and limited query capabilities. In this paper we show that because sources have restrictions on retrieving their infor...
RAS
2006
13 years 8 months ago
2006
This paper proposes a mobile printer system (MPS) based on multi-robot cooperation. The system consists of multiple mobile robots, a wireless LAN system, a graphic user interface ...