Sciweavers

1283 search results - page 168 / 257
» Probabilistic structured query methods
Sort
View
EMNLP
2007
13 years 10 months ago
Fast and Robust Multilingual Dependency Parsing with a Generative Latent Variable Model
We use a generative history-based model to predict the most likely derivation of a dependency parse. Our probabilistic model is based on Incremental Sigmoid Belief Networks, a rec...
Ivan Titov, James Henderson
GECCO
2008
Springer
135views Optimization» more  GECCO 2008»
13 years 10 months ago
iBOA: the incremental bayesian optimization algorithm
This paper proposes the incremental Bayesian optimization algorithm (iBOA), which modifies standard BOA by removing the population of solutions and using incremental updates of t...
Martin Pelikan, Kumara Sastry, David E. Goldberg
IPL
2006
72views more  IPL 2006»
13 years 9 months ago
Cayley graphs as models of deterministic small-world networks
Many real networks, including those in social, technological, and biological realms, are small-world networks. The two distinguishing characteristics of small-world networks are h...
Wenjun Xiao, Behrooz Parhami
ALGORITHMICA
2005
110views more  ALGORITHMICA 2005»
13 years 9 months ago
Biased Skip Lists
We design a variation of skip lists that performs well for generally biased access sequences. Given n items, each with a positive weight wi, 1 i n, the time to access item i is O...
Amitabha Bagchi, Adam L. Buchsbaum, Michael T. Goo...
TSMC
2008
122views more  TSMC 2008»
13 years 9 months ago
A Geometric Approach to the Theory of Evidence
In this paper, we propose a geometric approach to the theory of evidence based on convex geometric interpretations of its two key notions of belief function (b.f.) and Dempster...
Fabio Cuzzolin