7106 search results - page 432 / 1422 » Restricted Complexity, General Complexity |
201
click to vote
CORR
2007
Springer
15 years 7 months ago
2007
Springer
A tree decomposition of the coordinates of a code is a mapping from the coordinate set to the set of vertices of a tree. A tree decomposition can be extended to a tree realization,...
200
click to vote
SIAMCOMP
1998
15 years 7 months ago
1998
A language is L-printable if there is a logspace algorithm which, on input 1n, prints all members in the language of length n. Following the work of Allender and Rubinstein [SIAM J...
254
click to vote
PPDP
2010
Springer
15 years 5 months ago
2010
Springer
This paperdescribes the use of a powerful graph query language for querying programs, and a novel combination of transformations for generating efficient implementations of the q...
220
click to vote
ICCV
2009
IEEE
17 years 13 days ago
2009
IEEE
Local experts have been used to great effect for fitting deformable
models to images. Typically, the best location in
an image for the deformable model’s landmarks are found
t...
163
click to vote
CVPR
2003
IEEE
16 years 9 months ago
2003
IEEE
Inhomogeneous Gibbs model (IGM) [4] is an effective maximum entropy model in characterizing complex highdimensional distributions. However, its training process is so slow that th...