Sciweavers

21 search results - page 3 / 5
» On lazy randomized incremental construction
Sort
View
ESWS
2004
Springer
14 years 22 days ago
Directory Services for Incremental Service Integration
Abstract. In an open environment populated by heterogeneous information services integration will be a major challenge. Even if the problem is similar to planning in some aspects, ...
Ion Constantinescu, Walter Binder, Boi Faltings
ESA
2004
Springer
95views Algorithms» more  ESA 2004»
14 years 22 days ago
On Dynamic Shortest Paths Problems
We obtain the following results related to dynamic versions of the shortest-paths problem: (i) Reductions that show that the incremental and decremental singlesource shortest-paths...
Liam Roditty, Uri Zwick

Publication
252views
13 years 10 months ago
Context models on sequences of covers
We present a class of models that, via a simple construction, enables exact, incremental, non-parametric, polynomial-time, Bayesian inference of conditional measures. The approac...
Christos Dimitrakakis
WADS
2009
Springer
267views Algorithms» more  WADS 2009»
13 years 12 months ago
Computing the Implicit Voronoi Diagram in Triple Precision
In a paper that considered arithmetic precision as a limited resource in the design and analysis of algorithms, Liotta, Preparata and Tamassia defined an “implicit Voronoi diagr...
David L. Millman, Jack Snoeyink
TACAS
2010
Springer
255views Algorithms» more  TACAS 2010»
13 years 5 months ago
Satisfiability Modulo the Theory of Costs: Foundations and Applications
Abstract. We extend the setting of Satisfiability Modulo Theories (SMT) by introducing a theory of costs C, where it is possible to model and reason about resource consumption and ...
Alessandro Cimatti, Anders Franzén, Alberto...