Sciweavers

266 search results - page 42 / 54
» Linear Recursion
Sort
View
CVPR
2006
IEEE
16 years 1 months ago
A Design Principle for Coarse-to-Fine Classification
Coarse-to-fine classification is an efficient way of organizing object recognition in order to accommodate a large number of possible hypotheses and to systematically exploit shar...
Sachin Gangaputra, Donald Geman
ICIP
2003
IEEE
16 years 1 months ago
Face description based on decomposition and combining of a facial space with LDA
We propose a method of efficient face description for facial image retrieval from a large data set. The novel descriptor is obtained by decomposing the face image into several com...
Tae-Kyun Kim, Hyunwoo Kim, Wonjun Hwang, Seok-Cheo...
ICML
2009
IEEE
16 years 19 days ago
Bandit-based optimization on graphs with application to library performance tuning
The problem of choosing fast implementations for a class of recursive algorithms such as the fast Fourier transforms can be formulated as an optimization problem over the language...
Arpad Rimmel, Frédéric de Mesmay, Ma...
STOC
2007
ACM
132views Algorithms» more  STOC 2007»
16 years 4 days ago
On the convergence of Newton's method for monotone systems of polynomial equations
Monotone systems of polynomial equations (MSPEs) are systems of fixed-point equations X1 = f1(X1, . . . , Xn), . . . , Xn = fn(X1, . . . , Xn) where each fi is a polynomial with p...
Stefan Kiefer, Michael Luttenberger, Javier Esparz...
LICS
2007
IEEE
15 years 6 months ago
First-Order and Temporal Logics for Nested Words
Nested words are a structured model of execution paths in procedural programs, reflecting their call and return nesting structure. Finite nested words also capture the structure ...
Rajeev Alur, Marcelo Arenas, Pablo Barceló,...