1322 search results - page 44 / 265 » Parameterized counting problems |
105
Voted
FMOODS
2007
15 years 4 months ago
2007
Abstract. Algorithmic skeletons are a well-known approach for implementing parallel and distributed applications. Declarative versions typically use higher-order functions in funct...
126
click to vote
CVPR
2008
IEEE
16 years 4 months ago
2008
IEEE
Parameterized Appearance Models (PAMs) (e.g. Eigentracking, Active Appearance Models, Morphable Models) are commonly used to model the appearance and shape variation of objects in...
124
Voted
GD
2006
Springer
15 years 6 months ago
2006
Springer
st-orientations (st-numberings) or bipolar orientations of undirected graphs are central to many graph algorithms and applications. Several algorithms have been proposed in the pas...
100
Voted
ICALP
2010
Springer
15 years 4 months ago
2010
Springer
We investigate the parameterized computational complexity of the satisfiability problem for modal logic and attempt to pinpoint relevant structural parameters which cause the probl...
116
Voted
AUTOMATICA
2006
15 years 2 months ago
2006
This paper revisits a well-known synthesis problem in iterative learning control, where the objective is to optimize a performance criterion over a class of causal iterations. The...