61 search results - page 8 / 13 » Probable Innocence Revisited |
90
Voted
STACS
2001
Springer
15 years 4 months ago
2001
Springer
Most known constructions of probabilistically checkable proofs (PCPs) either blow up the proof size by a large polynomial, or have a high (though constant) query complexity. In thi...
GECCO
2006
Springer
15 years 3 months ago
2006
Springer
In this paper, the issue of adapting probabilities for Evolutionary Algorithm (EA) search operators is revisited. A framework is devised for distinguishing between measurements of...
NETWORKING
2008
15 years 1 months ago
2008
We revisit the peer selection problem of finding the most nearby peer from an initiating node. The metrics to assess the closeness between peers are hopcount and delay, respectivel...
130
click to vote
VISAPP
2007
15 years 27 days ago
2007
In this paper, we address the problem of robustly recovering several instances of a curve model from a single noisy data set with outliers. Using M-estimators revisited in a Lagran...
102
click to vote
RECOMB
2008
Springer
16 years 1 days ago
2008
Springer
Abstract. As data about genomic architecture accumulates, genomic rearrangements have attracted increasing attention. One of the main rearrangement mechanisms, inversions (also cal...