1732 search results - page 20 / 347 » Sequences of Level 1, 2, 3, ..., k , .. |
146
click to vote
COCO
1989
Springer
15 years 10 months ago
1989
Springer
Kadin [6] showed that if the Polynomial Hierarchy (PH) has infinitely many levels, then for all k, PSAT[k] ⊂ PSAT[k+1]. This paper extends Kadin’s technique and shows that a p...
140
click to vote
ISBI
2009
IEEE
16 years 23 days ago
2009
IEEE
Various cortical measures such as cortical thickness are routinely computed along the vertices of cortical surface meshes. These metrics are used in surface-based morphometric stu...
201
click to vote
AAIM
2007
Springer
16 years 4 days ago
2007
Springer
Given an undirected graph G = (V, E) and a weight function w : E → Z+ , we consider the problem of orienting all edges in E so that the maximum weighted outdegree among all verti...
206
click to vote
ECCV
2008
Springer
16 years 7 months ago
2008
Springer
In this work, we present an approach to jointly segment a rigid object in a 2D image and estimate its 3D pose, using the knowledge of a 3D model. We naturally couple the two proces...
116
click to vote
COMBINATORICS
2002
15 years 5 months ago
2002
A sequence u = u1u2...un is said to be nonrepetitive if no two adjacent blocks of u are exactly the same. For instance, the sequence abcbcba contains a repetition bcbc, while abca...