450 search results - page 49 / 90 » The Complexity of Computing Minimal Unidirectional Covering ... |
ICASSP
2009
IEEE
15 years 6 months ago
2009
IEEE
We introduce a new exemplar-based inpainting algorithm that represents the region to be inpainted as a sparse linear combination of example blocks, extracted from the image being ...
GECCO
2006
Springer
15 years 3 months ago
2006
Springer
Wire routing in a VLSI chip often requires minimization of wire-length as well as the number of intersections among multiple nets. Such an optimization problem is computationally ...
106
click to vote
PODS
2010
ACM
15 years 5 months ago
2010
ACM
Both semantic and type-based query optimization rely on the idea that queries often exhibit non-trivial rewritings if the state space of the database is restricted. Despite their ...
131
click to vote
ATAL
1997
Springer
15 years 4 months ago
1997
Springer
Abstract. Just as cooperation in multi-agent systems is a central issue for solving complex tasks, so too is the ability for an intelligent agent to reason about combined knowledge...
COR
2008
14 years 12 months ago
2008
The typical inventory routing problem deals with the repeated distribution of a single product from a single facility with an unlimited supply to a set of customers that can all b...