12264 search results - page 155 / 2453 » An Analysis of the XSL Algorithm |
107
click to vote
FOSSACS
2010
Springer
15 years 12 months ago
2010
Springer
Depth-bounded processes form the most expressive known fragment of the π-calculus for which interesting verification problems are still decidable. In this paper we develop an ade...
145
click to vote
COLT
2005
Springer
15 years 10 months ago
2005
Springer
We start by showing that in an active learning setting, the Perceptron algorithm needs Ω( 1 ε2 ) labels to learn linear separators within generalization error ε. We then prese...
147
Voted
PLDI
2011
ACM
14 years 8 months ago
2011
ACM
We present a strictly bottom-up, summary-based, and precise heap analysis targeted for program verification that performs strong updates to heap locations at call sites. We firs...
342
click to vote
TMA
2012
Springer
14 years 19 days ago
2012
Springer
Abstract. In this paper we present an algorithm that is able to progressively discover nodes of a Skype overlay P2P network. Most notably, super nodes in the network core. Starting...
174
click to vote
ICALP
2011
Springer
14 years 8 months ago
2011
Springer
Competitive analysis is the established tool for measuring the output quality of algorithms that work in an online environment. Recently, the model of advice complexity has been in...