4565 search results - page 716 / 913 » Time Optimal Self-Stabilizing Algorithms |
104
click to vote
EDBT
2008
ACM
16 years 23 days ago
2008
ACM
Enterprises may have multiple database systems spread across the organization for redundancy or for serving different applications. In such systems, query workloads can be distrib...
DCC
2004
IEEE
16 years 7 days ago
2004
IEEE
In the discrete filtering problem, a data sequence over a finite alphabet is assumed to be corrupted by a discrete memoryless channel. The goal is to reconstruct the clean sequenc...
119
Voted
BMCBI
2010
15 years 23 days ago
2010
Background: There are many important clustering questions in computational biology for which no satisfactory method exists. Automated clustering algorithms, when applied to large,...
114
click to vote
SIAMCOMP
2002
15 years 9 days ago
2002
Let us consider an ordered vector A[1 : n]. If the cost of testing each position is similar, then the standard binary search is the best strategy to search the vector. This is true...
114
Voted
PE
2010
Springer
14 years 11 months ago
2010
Springer
Solution of large sparse linear fixed-point problems lies at the heart of many important performance analysis calculations. These calculations include steady-state, transient and...