Sciweavers

243 search results - page 27 / 49
» Drawing Borders Efficiently
Sort
View
FMCAD
2008
Springer
13 years 9 months ago
Automatic Generation of Local Repairs for Boolean Programs
Automatic techniques for software verification focus on obtaining witnesses of program failure. Such counterexamples often fail to localize the precise cause of an error and usuall...
Roopsha Samanta, Jyotirmoy V. Deshmukh, E. Allen E...
UAI
2008
13 years 9 months ago
The Phylogenetic Indian Buffet Process: A Non-Exchangeable Nonparametric Prior for Latent Features
Nonparametric Bayesian models are often based on the assumption that the objects being modeled are exchangeable. While appropriate in some applications (e.g., bag-ofwords models f...
Kurt T. Miller, Thomas L. Griffiths, Michael I. Jo...
CORR
2010
Springer
73views Education» more  CORR 2010»
13 years 7 months ago
On the Impact of the Migration Topology on the Island Model
Parallel Global Optimization Algorithms (PGOA) provide an efficient way of dealing with hard optimization problems. One method of parallelization of GOAs that is frequently applie...
Marek Rucinski, Dario Izzo, Francesco Biscani
CORR
2010
Springer
128views Education» more  CORR 2010»
13 years 7 months ago
TAGME: on-the-fly annotation of short text fragments (by Wikipedia entities)
We designed and implemented Tagme, a system that is able to efficiently and judiciously augment a plain-text with pertinent hyperlinks to Wikipedia pages. The specialty of Tagme w...
Paolo Ferragina, Ugo Scaiella
MSS
2008
IEEE
118views Hardware» more  MSS 2008»
13 years 7 months ago
Computing the minimal covering set
We present the first polynomial-time algorithm for computing the minimal covering set of a (weak) tournament. The algorithm draws upon a linear programming formulation of a subset...
Felix Brandt, Felix A. Fischer