1805 search results - page 201 / 361 » Functional programming with structured graphs |
STOC
1995
ACM
15 years 5 months ago
1995
ACM
We present a unified framework for designing polynomial time approximation schemes (PTASs) for “dense” instances of many NP-hard optimization problems, including maximum cut,...
133
click to vote
ICDAR
2005
IEEE
15 years 7 months ago
2005
IEEE
The table recognition literature contains many strategies specified informally as a sequence of operations, obscuring both models of table structure and the effects of individual...
111
click to vote
SCAM
2006
IEEE
15 years 7 months ago
2006
IEEE
Programmers often want to transform the source or binary representations of their programs (e.g., to optimize, add dynamic safety checks, or add profile gathering code). Unfortun...
IPPS
1998
IEEE
15 years 5 months ago
1998
IEEE
The problem of scheduling a weighted directed acyclic graph (DAG) to a set of homogeneous processors to minimize the completion time has been extensively studied. The NPcompletene...
109
click to vote
UAI
2003
15 years 2 months ago
2003
Continuous time Bayesian networks (CTBN) describe structured stochastic processes with finitely many states that evolve over continuous time. A CTBN is a directed (possibly cycli...