Sciweavers

4539 search results - page 860 / 908
» Approaches to Compute Workflow Complexity
Sort
View
SEMCO
2009
IEEE
15 years 4 months ago
LexPar: A Freely Available English Paraphrase Lexicon Automatically Extracted from FrameNet
—This is a paper about a new resource, namely an English paraphrase dictionary extracted from the FrameNet lexicon and its example data base. I. THE LEXPAR PARAPHRASE DICTIONARY ...
Bob Coyne, Owen Rambow
COCO
2009
Springer
155views Algorithms» more  COCO 2009»
15 years 4 months ago
Weak Derandomization of Weak Algorithms: Explicit Versions of Yao's Lemma
—A simple averaging argument shows that given a randomized algorithm A and a function f such that for every input x, Pr[A(x) = f(x)] ≥ 1−ρ (where the probability is over the...
Ronen Shaltiel
DCOSS
2009
Springer
15 years 4 months ago
Finding Symbolic Bug Patterns in Sensor Networks
Abstract. This paper presents a failure diagnosis algorithm for summarizing and generalizing patterns that lead to instances of anomalous behavior in sensor networks. Often multipl...
Mohammad Maifi Hasan Khan, Tarek F. Abdelzaher, Ji...
SCALESPACE
2009
Springer
15 years 4 months ago
A Multi-scale Feature Based Optic Flow Method for 3D Cardiac Motion Estimation
Abstract. The dynamic behavior of the cardiac muscle is strongly dependent on heart diseases. Optic flow techniques are essential tools to assess and quantify the contraction of t...
Alessandro Becciu, Hans C. van Assen, Luc Florack,...
PPOPP
2010
ACM
15 years 4 months ago
Thread to strand binding of parallel network applications in massive multi-threaded systems
In processors with several levels of hardware resource sharing, like CMPs in which each core is an SMT, the scheduling process becomes more complex than in processors with a singl...
Petar Radojkovic, Vladimir Cakarevic, Javier Verd&...