Sciweavers

6365 search results - page 42 / 1273
» Fast Local Computation Algorithms
Sort
View
135
Voted
ICCV
2007
IEEE
16 years 4 months ago
Fast Crowd Segmentation Using Shape Indexing
This paper presents a fast, accurate, and novel method for the problem of estimating the number of humans and their positions from background differenced images obtained from a si...
Lan Dong, Vasu Parameswaran, Visvanathan Ramesh, I...
BIBM
2010
IEEE
156views Bioinformatics» more  BIBM 2010»
15 years 11 days ago
Truncation of protein sequences for fast profile alignment with application to subcellular localization
We have recently found that the computation time of homology-based subcellular localization can be substantially reduced by aligning profiles up to the cleavage site positions of s...
Man-Wai Mak, Wei Wang, Sun-Yuan Kung
ICCV
1999
IEEE
16 years 4 months ago
Fast Approximate Energy Minimization via Graph Cuts
In this paper we address the problem of minimizing a large class of energy functions that occur in early vision. The major restriction is that the energy function's smoothnes...
Yuri Boykov, Olga Veksler, Ramin Zabih
KDD
2005
ACM
178views Data Mining» more  KDD 2005»
15 years 7 months ago
Failure detection and localization in component based systems by online tracking
The increasing complexity of today’s systems makes fast and accurate failure detection essential for their use in mission-critical applications. Various monitoring methods provi...
Haifeng Chen, Guofei Jiang, Cristian Ungureanu, Ke...
WDAG
2005
Springer
130views Algorithms» more  WDAG 2005»
15 years 7 months ago
Fast Deterministic Distributed Maximal Independent Set Computation on Growth-Bounded Graphs
Abstract. The distributed complexity of computing a maximal independent set in a graph is of both practical and theoretical importance. While there exists an elegant O(log n) time ...
Fabian Kuhn, Thomas Moscibroda, Tim Nieberg, Roger...