5153 search results - page 8 / 1031 » Introduction to Randomized Algorithms |
143
click to vote
SODA
2012
ACM
13 years 6 months ago
2012
ACM
The Odd Cycle Transversal problem (OCT) asks whether a given graph can be made bipartite by deleting at most k of its vertices. In a breakthrough result Reed, Smith, and Vetta (Op...
133
click to vote
ICIP
2005
IEEE
16 years 5 months ago
2005
IEEE
In this paper we present a probabilistic framework for tracking objects based on local dynamic segmentation. We view the segn to be a Markov labeling process and abstract it as a ...
133
click to vote
IDEAS
2007
IEEE
15 years 10 months ago
2007
IEEE
We present an extensible and customizable framework for the autonomous discovery of Semantic Web services based on their QoS properties. Using semantic technologies, users can spe...
118
click to vote
ICANNGA
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. We present an approach for automated generation of proactive aggregation protocols using Genetic Programming. First a short introduction into aggregation and proactive pr...
138
click to vote
ESOP
2009
Springer
15 years 7 months ago
2009
Springer
Gordon and Jeffrey have proposed a type and effect system for checking authenticity in cryptographic protocols. The type system reduces the protocol verification problem to the typ...