834 search results - page 57 / 167 » A Decomposition Technique for Max-CSP |
ICB
2009
Springer
14 years 4 months ago
2009
Springer
This paper presents a technique for decomposing an unseen 3D face under any facial expression into an estimated 3D neutral face and expression deformations (the shape residue betwe...
ACSC
2007
IEEE
14 years 4 months ago
2007
IEEE
This paper presents new algorithms for computing single source shortest paths (SSSPs) in a nearly acyclic directed graph G. The first part introduces higher-order decomposition. ...
CIKM
2003
Springer
14 years 3 months ago
2003
Springer
Traffic analysis, in the context of Telecommunications or Internet and Web data, is crucial for large network operations. Data in such networks is often provided as large graphs w...
ICALP
2010
Springer
14 years 2 months ago
2010
Springer
Abstract. We provide a framework for the design and analysis of dynamic programming algorithms for surface-embedded graphs on n vertices and branchwidth at most k. Our technique ap...
SAS
1999
Springer
14 years 2 months ago
1999
Springer
Complementation, the inverse of the reduced product operation, is a technique for systemfinding minimal decompositions of abstract domains. Fil´e and Ranzato advanced the state ...