Sciweavers

1425 search results - page 63 / 285
» Beyond Dependency Graphs
Sort
View
NIPS
2007
13 years 9 months ago
Local Algorithms for Approximate Inference in Minor-Excluded Graphs
We present a new local approximation algorithm for computing MAP and logpartition function for arbitrary exponential family distribution represented by a finite-valued pair-wise ...
Kyomin Jung, Devavrat Shah
OOPSLA
1999
Springer
14 years 10 days ago
The Generic Graph Component Library
In this paper we present the Generic Graph Component Library (GGCL), a generic programming framework for graph data structures and graph algorithms. Following the theme of the Sta...
Lie-Quan Lee, Jeremy G. Siek, Andrew Lumsdaine
SIAMDM
2008
148views more  SIAMDM 2008»
13 years 8 months ago
A New Algorithm for On-line Coloring Bipartite Graphs
We first show that for any bipartite graph H with at most five vertices, there exists an on-line competitive algorithm for the class of H-free bipartite graphs. We then analyze th...
Hajo Broersma, Agostino Capponi, Daniël Paulu...
ISPD
2010
ACM
249views Hardware» more  ISPD 2010»
14 years 2 months ago
A matching based decomposer for double patterning lithography
Double Patterning Lithography (DPL) is one of the few hopeful candidate solutions for the lithography for CMOS process beyond 45nm. DPL assigns the patterns less than a certain di...
Yue Xu, Chris Chu
AIPS
2003
13 years 9 months ago
Reasoning about Autonomous Processes in an Estimated-Regression Planner
We examine the issues that arise in extending an estimatedregression (ER) planner to reason about autonomous processes that run and have continuous and discrete effects without th...
Drew V. McDermott