3415 search results - page 341 / 683 » Lower bounds on kernelization |
181
Voted
FCT
2009
Springer
16 years 1 months ago
2009
Springer
Despite of their applicability betweennness constraints have (to the authorās knowledge) hardly been considered from the random structures point of view. They are essentially diļ...
158
click to vote
ICASSP
2008
IEEE
16 years 1 months ago
2008
IEEE
Given limited or incomplete measurement data on a sphere, a new iterative algorithm is proposed on how to extrapolate signal over the whole sphere. The algorithm is based on a pri...
152
click to vote
CIE
2007
Springer
16 years 27 days ago
2007
Springer
We survey our current knowledge of circuit complexity of regular languages and we prove that regular languages that are in AC0 and ACC0 are all computable by almost linear size ci...
145
Voted
CPAIOR
2007
Springer
16 years 27 days ago
2007
Springer
Abstract. We propose generalizations of the Global Cardinality Constraint (gcc) in which a partition of the variables is given. In the context of resource allocation problems, such...
179
click to vote
ICALP
2007
Springer
16 years 26 days ago
2007
Springer
Abstract. We deļ¬ne and study two versions of the bipartite matching problem in the framework of two-stage stochastic optimization with recourse. In one version the uncertainty is...