Sciweavers

2822 search results - page 168 / 565
» Global Optimization of Histograms
Sort
View
EMNLP
2008
15 years 6 months ago
Attacking Decipherment Problems Optimally with Low-Order N-gram Models
We introduce a method for solving substitution ciphers using low-order letter n-gram models. This method enforces global constraints using integer programming, and it guarantees t...
Sujith Ravi, Kevin Knight
ANOR
2002
100views more  ANOR 2002»
15 years 4 months ago
A Limited-Memory Multipoint Symmetric Secant Method for Bound Constrained Optimization
A new algorithm for solving smooth large-scale minimization problems with bound constraints is introduced. The way of dealing with active constraints is similar to the one used in...
Oleg P. Burdakov, José Mario Martíne...
CEC
2010
IEEE
15 years 3 months ago
A novel hybrid evolutionary strategy and its periodization with multi-objective genetic optimizers
— This work investigates the effects of the periodization of local and global multi-objective search algorithms. To this, we introduce a model for periodization and define a new...
Paul Kaufmann, Tobias Knieper, Marco Platzner
DLS
2010
141views Languages» more  DLS 2010»
15 years 2 months ago
Optimizing dynamic dispatch with fine-grained state tracking
Dynamic mixin is a construct available in Ruby and other dynamic languages. It can be used as a base to implement a range of programming paradigms, such as dynamic aspectoriented ...
Salikh Zakirov, Shigeru Chiba, Etsuya Shibayama
ECCV
1996
Springer
16 years 6 months ago
Image Recognition with Occlusions
We study the problem of how to detect \interesting objects" appeared in a given image, I. Our approach is to treat it as a function approximation problem based on an over-redu...
Tyng-Luh Liu, Michael J. Donahue, Davi Geiger, Rob...