Sciweavers

3142 search results - page 445 / 629
» Solving Hierarchical Optimization Problems Using MOEAs
Sort
View
ICCV
2005
IEEE
15 years 6 months ago
Learning Non-Generative Grammatical Models for Document Analysis
— We present a general approach for the hierarchical segmentation and labeling of document layout structures. This approach models document layout as a grammar and performs a glo...
Michael Shilman, Percy Liang, Paul A. Viola
109
Voted
CVPR
2010
IEEE
14 years 11 months ago
Transform Coding for Fast Approximate Nearest Neighbor Search in High Dimensions
We examine the problem of large scale nearest neighbor search in high dimensional spaces and propose a new approach based on the close relationship between nearest neighbor search...
Jonathan Brandt
111
Voted
CONSTRAINTS
2007
100views more  CONSTRAINTS 2007»
15 years 14 days ago
Design of Financial CDO Squared Transactions Using Constraint Programming
We give an approximate and often extremely fast method of building a particular kind of portfolio in finance, here called a portfolio design (PD), with applications in the credit ...
Pierre Flener, Justin Pearson, Luis G. Reyna, Olof...
ISBRA
2009
Springer
15 years 7 months ago
Untangling Tanglegrams: Comparing Trees by Their Drawings
A tanglegram is a pair of trees on the same set of leaves with matching leaves in the two trees joined by an edge. Tanglegrams are widely used in biology – to compare evolutiona...
Balaji Venkatachalam, Jim Apple, Katherine St. Joh...
ICML
2004
IEEE
16 years 1 months ago
Surrogate maximization/minimization algorithms for AdaBoost and the logistic regression model
Surrogate maximization (or minimization) (SM) algorithms are a family of algorithms that can be regarded as a generalization of expectation-maximization (EM) algorithms. There are...
Zhihua Zhang, James T. Kwok, Dit-Yan Yeung