Sciweavers

8496 search results - page 259 / 1700
» Problem Solving and Complex Systems
Sort
View
ICDE
2007
IEEE
113views Database» more  ICDE 2007»
16 years 8 months ago
Reducing Order Enforcement Cost in Complex Query Plans
Algorithms that exploit sort orders are widely used to implement joins, grouping, duplicate elimination and other set operations. Query optimizers traditionally deal with sort ord...
Ravindra Guravannavar, S. Sudarshan
COMPGEOM
2010
ACM
15 years 11 months ago
Finding shortest non-trivial cycles in directed graphs on surfaces
Let D be a weighted directed graph cellularly embedded in a surface of genus g, orientable or not, possibly with boundary. We describe algorithms to compute a shortest non-contrac...
Sergio Cabello, Éric Colin de Verdiè...
SODA
2010
ACM
173views Algorithms» more  SODA 2010»
16 years 4 months ago
Distributed Agreement with Optimal Communication Complexity
We consider the problem of fault-tolerant agreement in a crash-prone synchronous system. We present a new randomized consensus algorithm that achieves optimal communication effici...
Seth Gilbert, Dariusz Kowalski
SIAMSC
2008
142views more  SIAMSC 2008»
15 years 5 months ago
Algebraic Multigrid Solvers for Complex-Valued Matrices
In the mathematical modeling of real-life applications, systems of equations with complex coefficients often arise. While many techniques of numerical linear algebra, e.g., Krylovs...
Scott MacLachlan, Cornelis W. Oosterlee
FOCS
2009
IEEE
16 years 1 months ago
Approximability of Combinatorial Problems with Multi-agent Submodular Cost Functions
Abstract— Applications in complex systems such as the Internet have spawned recent interest in studying situations involving multiple agents with their individual cost or utility...
Gagan Goel, Chinmay Karande, Pushkar Tripathi, Lei...