Sciweavers

137 search results - page 2 / 28
» On probabilistic analysis of randomization in hybrid symboli...
Sort
View
SIGMOD
2011
ACM
250views Database» more  SIGMOD 2011»
12 years 8 months ago
Hybrid in-database inference for declarative information extraction
In the database community, work on information extraction (IE) has centered on two themes: how to effectively manage IE tasks, and how to manage the uncertainties that arise in th...
Daisy Zhe Wang, Michael J. Franklin, Minos N. Garo...
EVOW
2007
Springer
13 years 11 months ago
A Probabilistic Beam Search Approach to the Shortest Common Supersequence Problem
The Shortest Common Supersequence Problem (SCSP) is a well-known hard combinatorial optimization problem that formalizes many real world problems. This paper presents a novel rando...
Christian Blum, Carlos Cotta, Antonio J. Fern&aacu...
RSA
2006
68views more  RSA 2006»
13 years 5 months ago
The probabilistic analysis of a greedy satisfiability algorithm
: On input a random 3-CNF formula of clauses-to-variables ratio r3 applies repeatedly the following simple heuristic: Set to True a literal that appears in the maximum number of cl...
Alexis C. Kaporis, Lefteris M. Kirousis, Efthimios...
VOSS
2004
Springer
135views Mathematics» more  VOSS 2004»
13 years 10 months ago
Analysing Randomized Distributed Algorithms
Abstract. Randomization is of paramount importance in practical applications and randomized algorithms are used widely, for example in co-ordinating distributed computer networks, ...
Gethin Norman
CONCUR
2006
Springer
13 years 9 months ago
Probability and Nondeterminism in Operational Models of Concurrency
We give a brief overview of operational models for concurrent systems that exhibit probabilistic behavior, focussing on the interplay between probability and nondeterminism. Our su...
Roberto Segala