Sciweavers

10493 search results - page 1397 / 2099
» Dynamic Word Problems
Sort
View
SODA
2003
ACM
122views Algorithms» more  SODA 2003»
15 years 8 months ago
Fast distributed algorithms for (weakly) connected dominating sets and linear-size skeletons
Motivated by routing issues in ad hoc networks, we present polylogarithmic-time distributed algorithms for two problems. Given a network, we first show how to compute connected a...
Devdatt P. Dubhashi, Alessandro Mei, Alessandro Pa...
BDA
2000
15 years 8 months ago
Incremental Mining of Sequential Patterns in Large Databases
In this paper we consider the problem of the incremental mining of sequential patterns when new transactions or new customers are added to an original database. We present a new a...
Florent Masseglia, Pascal Poncelet, Maguelonne Tei...
EWCG
2000
15 years 8 months ago
Exploring an Unknown Cellular Environment
We investigate the exploration problem of a short-sighted mobile robot moving about in an unknown cellular room. In order to explore a cell, the robot must enter it. Once inside, ...
Christian Icking, Thomas Kamphans, Rolf Klein, Elm...
ISMB
2000
15 years 8 months ago
A Practical Algorithm for Optimal Inference of Haplotypes from Diploid Populations
The next phase of human genomics will involve largescale screens of populations for signi cant DNA polymorphisms, notably single nucleotide polymorphisms SNP's. Dense human S...
Dan Gusfield
PPSC
1997
15 years 8 months ago
The Future Fast Fourier Transform?
It seems likely that improvements in arithmetic speed will continue to outpace advances in communication bandwidth. Furthermore, as more and more problems are working on huge datas...
Alan Edelman, Peter McCorquodale, Sivan Toledo
« Prev « First page 1397 / 2099 Last » Next »