1115 search results - page 131 / 223 » Separating Shape Graphs |
234
click to vote
LCC
1994
15 years 6 months ago
1994
The descriptive complexity of a problem is the complexity of describing the problem in some logical formalism. One of the few techniques for proving separation results in descripti...
126
Voted
LCTRTS
2009
Springer
15 years 9 months ago
2009
Springer
Register allocation is often a two-phase approach: spilling of registers to memory, followed by coalescing of registers. Extreme liverange splitting (i.e. live-range splitting aft...
137
click to vote
WADS
2001
Springer
15 years 7 months ago
2001
Springer
Even though a large number of I/O-efficient graph algorithms have been developed, a number of fundamental problems still remain open. For example, no space- and I/O-efficient algo...
107
Voted
CVPR
2008
IEEE
16 years 4 months ago
2008
IEEE
We pose the recognition problem as data association. In this setting, a novel object is explained solely in terms of a small set of exemplar objects to which it is visually simila...
126
click to vote
FGR
2006
IEEE
15 years 6 months ago
2006
IEEE
Active statistical models including active shape models and active appearance models are very powerful for face alignment. They are composed of two parts: the subspace model(s) an...