1522 search results - page 252 / 305 » On the Complexity of Several Haplotyping Problems |
141
click to vote
CCA
2009
Springer
15 years 2 months ago
2009
Springer
Interval computations estimate the uncertainty of the result of data processing in situations in which we only know the upper bounds ∆ on the measurement errors. In this case, ba...
124
click to vote
FOCS
2000
IEEE
15 years 2 months ago
2000
IEEE
In this article, we show several results obtained by combining the use of stable distributions with pseudorandom generators for bounded space. In particular: —We show that, for a...
VLSID
1998
IEEE
15 years 2 months ago
1998
IEEE
With several commercial tools becoming available, the high-level synthesis of applicationspeci c integrated circuits is nding wide spread acceptance in VLSI industry today. Existi...
CVPR
1996
IEEE
15 years 1 months ago
1996
IEEE
The Saliency Network proposed by Shashua and Ullman (1988) is a well-known approach to the problem of extracting salient curves from images while performing gap completion. This pa...
PODC
2010
ACM
15 years 1 months ago
2010
ACM
We introduce Multi-Trials, a new technique for symmetry breaking for distributed algorithms and apply it to various problems in general graphs. For instance, we present three rand...