Sciweavers

995 search results - page 20 / 199
» Wire-speed total order
Sort
View
FSTTCS
2000
Springer
14 years 7 days ago
Dynamically Ordered Probabilistic Choice Logic Programming
We present a framework for decision making under uncertainty where the priorities of the alternatives can depend on the situation at hand. We design a logic-programming language, D...
Marina De Vos, Dirk Vermeir
COMBINATORICS
2002
82views more  COMBINATORICS 2002»
13 years 8 months ago
The Directed Anti-Oberwolfach Solution: Pancyclic 2-Factorizations of Complete Directed Graphs of Odd Order
The directed anti-Oberwolfach problem asks for a 2-factorization (each factor has in-degree 1 and out-degree 1 for a total degree of two) of K2n+1, not with consistent cycle compo...
Brett Stevens
PODS
2008
ACM
221views Database» more  PODS 2008»
14 years 8 months ago
A generic flow algorithm for shared filter ordering problems
We consider a fundamental flow maximization problem that arises during the evaluation of multiple overlapping queries defined on a data stream, in a heterogenous parallel environm...
Zhen Liu, Srinivasan Parthasarathy 0002, Anand Ran...
SIAMIS
2010
147views more  SIAMIS 2010»
13 years 7 months ago
Augmented Lagrangian Method, Dual Methods, and Split Bregman Iteration for ROF, Vectorial TV, and High Order Models
In image processing, the Rudin-Osher-Fatemi (ROF) model [L. Rudin, S. Osher, and E. Fatemi, Physica D, 60(1992), pp. 259–268] based on total variation (TV) minimization has prove...
Chunlin Wu, Xue-Cheng Tai
STOC
1990
ACM
108views Algorithms» more  STOC 1990»
14 years 20 days ago
Optimal Randomized Algorithms for Local Sorting and Set-Maxima
We present randomized algorithms for two sorting problems. In the local sorting problem, a graph is given in which each vertex is assigned an element of a total order, and the task...
Wayne Goddard, Valerie King, Leonard J. Schulman