Sciweavers

3918 search results - page 606 / 784
» Probabilistic model of triangulation
Sort
View
COLING
2000
14 years 4 days ago
Parsing with the Shortest Derivation
Common wisdom has it that tile bias of stochastic grammars in favor of shorter deriwttions of a sentence is hamfful and should be redressed. We show that the common wisdom is wron...
Rens Bod
GECCO
2008
Springer
152views Optimization» more  GECCO 2008»
13 years 12 months ago
Accelerating genetic programming by frequent subtree mining
One crucial issue in genetic programming (GP) is how to acquire promising building blocks efficiently. In this paper, we propose a GP method (called GPTM, GP with Tree Mining) whi...
Yoshitaka Kameya, Junichi Kumagai, Yoshiaki Kurata
GECCO
2008
Springer
135views Optimization» more  GECCO 2008»
13 years 12 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
HICSS
2010
IEEE
258views Biometrics» more  HICSS 2010»
13 years 11 months ago
An Empirical Comparison of Four Text Mining Methods
The amount of textual data that is available for researchers and businesses to analyze is increasing at a dramatic rate. This reality has led IS researchers to investigate various...
Sangno Lee, Jeff Baker, Jaeki Song, James C. Wethe...
CORR
2010
Springer
134views Education» more  CORR 2010»
13 years 11 months ago
Where is Randomness Needed to Break the Square-Root Bottleneck?
As shown by Tropp, 2008, for the concatenation of two orthonormal bases (ONBs), breaking the square-root bottleneck in compressed sensing does not require randomization over all th...
Patrick Kuppinger, Giuseppe Durisi, Helmut Bö...