Sciweavers

7129 search results - page 380 / 1426
» Approximation Algorithms for Treewidth
Sort
View
FOIKS
2008
Springer
15 years 6 months ago
Visibly Pushdown Transducers for Approximate Validation of Streaming XML
Visibly Pushdown Languages (VPLs), recognized by Visibly Pushdown Automata (VPAs), are a nicely behaved family of contextfree languages. It has been shown that VPAs are equivalent ...
Alex Thomo, Srinivasan Venkatesh, Ying Ying Ye
MST
2007
167views more  MST 2007»
15 years 4 months ago
The Complexity of Polynomial-Time Approximation
In 1996, Khanna and Motwani [KM96] proposed three logic-based optimization problems constrained by planar structure, and offered the hypothesis that these putatively fundamental ...
Liming Cai, Michael R. Fellows, David W. Juedes, F...
82
Voted
CDC
2008
IEEE
15 years 11 months ago
A monotonic algorithm for the optimal control of the Fokker-Planck equation
— Motivated by some crowd motion models in the presence of noise, we consider an optimal control problem governed by the Fokker-Planck equation. We sketch optimality conditions b...
Guillaume Carlier, Julien Salomon
AES
2007
Springer
109views Cryptology» more  AES 2007»
15 years 4 months ago
Compatible coarsening in the multigraph algorithm
We present some heuristics incorporating the philosophy of compatible relaxation into an existing algebraic multigrid method, the so-called multigraph solver of Bank and Smith [1]...
Randolph E. Bank
INFOCOM
2003
IEEE
15 years 10 months ago
Minimizing Request Blocking in All-Optical Rings
— In all-optical networks that use WDM technology it is often the case that several communication requests have to be blocked, due to bandwidth and technology limitations. Minimi...
Christos Nomikos, Aris Pagourtzis, Stathis Zachos