Sciweavers

16093 search results - page 2974 / 3219
» On the optimality of the neighbor-joining algorithm
Sort
View
SRDS
1999
IEEE
15 years 11 months ago
An Adaptive Checkpointing Protocol to Bound Recovery Time with Message Logging
Numerous mathematical approaches have been proposed to determine the optimal checkpoint interval for minimizing total execution time of an application in the presence of failures....
Kuo-Feng Ssu, Bin Yao, W. Kent Fuchs
SSDBM
1999
IEEE
124views Database» more  SSDBM 1999»
15 years 11 months ago
An Indexing Scheme for Fast Similarity Search in Large Time Series Databases
We address the problem of similarity search in large time series databases. We introduce a novel indexing algorithm that allows faster retrieval. The index is formed by creating b...
Eamonn J. Keogh, Michael J. Pazzani
ICALP
1999
Springer
15 years 11 months ago
Stable Marriage with Incomplete Lists and Ties
The original stable marriage problem requires all men and women to submit a complete and strictly ordered preference list. This is obviously often unrealistic in practice, and seve...
Kazuo Iwama, David Manlove, Shuichi Miyazaki, Yasu...
202
Voted
CVPR
1998
IEEE
15 years 11 months ago
Mosaics of Scenes with Moving Objects
Image mosaics are useful for a variety of tasks in vision and computer graphics. A particularly convenient way to generate mosaics is by `stitching' together many ordinary ph...
James Davis
DATE
1998
IEEE
106views Hardware» more  DATE 1998»
15 years 11 months ago
March Tests for Word-Oriented Memories
Most memory test algorithms are optimized tests for a particular memory technology and a particular set of fault models, under the assumption that the memory is bit-oriented; i.e....
A. J. van de Goor, Issam B. S. Tlili
« Prev « First page 2974 / 3219 Last » Next »