Sciweavers

6343 search results - page 80 / 1269
» Robust consensus computation
Sort
View
STOC
2000
ACM
156views Algorithms» more  STOC 2000»
15 years 5 months ago
Near optimal multiple alignment within a band in polynomial time
Multiple sequence alignment is a fundamental problem in computational biology. Because of its notorious difficulties, aligning sequences within a constant band (c-diagonal) is a ...
Ming Li, Bin Ma, Lusheng Wang
WDAG
1990
Springer
80views Algorithms» more  WDAG 1990»
15 years 4 months ago
Tight Bounds on the Round Complexity of Distributed 1-Solvable Tasks
A distributed task T is 1-solvable if there exists a protocol that solves it in the presence of (at most) one crash failure. A precise characterization of the 1-solvable tasks was...
Ofer Biran, Shlomo Moran, Shmuel Zaks
77
Voted
BMVC
2000
15 years 1 months ago
Fast Computation of a Boundary Preserving Estimate of Optical Flow
In this study we seek a fast method for robust, boundary preserving estimation of optical flow. Several studies have addressed this topic and proposed methods that account for vel...
Rosario El-Feghali, Amar Mitiche
92
Voted
CORR
2006
Springer
100views Education» more  CORR 2006»
15 years 18 days ago
If a tree casts a shadow is it telling the time?
Physical processes are computations only when we use them to externalize thought. Entities provide nature with a way to preserve structure over time. We think in terms of entities ...
Russ Abbott
87
Voted
ICDCS
2008
IEEE
15 years 7 months ago
Updates and Asynchronous Communication in Trusted Computing Systems
Software-based usage controls typically are vulnerable to attacks. Trusted Platform Modules (TPMs) can enable much more robust controls. However, as conventionally understood, TPM...
José Carlos Brustoloni, David Kyle