Sciweavers

216 search results - page 35 / 44
» Covering Problems with Hard Capacities
Sort
View
GIS
2004
ACM
14 years 8 months ago
Algorithms for the placement of diagrams on maps
This paper discusses a variety of ways to place diagrams like pie charts on maps, in particular, administrative subdivisions. The different ways come from different models of the ...
Étienne Schramm, Alexander Wolff, Marc J. v...
SIGMOD
2007
ACM
183views Database» more  SIGMOD 2007»
14 years 7 months ago
Report on the First International VLDB Workshop on Clean Databases (CleanDB 2006)
In this report, we provide a summary1 of the First Int'l VLDB Workshop on Clean Databases (CleanDB 2006), which took place at Seoul, Korea, on September 11, 2006, in conjunct...
Dongwon Lee, Chen Li
SAT
2009
Springer
117views Hardware» more  SAT 2009»
14 years 2 months ago
Dynamic Symmetry Breaking by Simulating Zykov Contraction
Abstract. We present a new method to break symmetry in graph coloring problems. While most alternative techniques add symmetry breaking predicates in a pre-processing step, we deve...
Bas Schaafsma, Marijn Heule, Hans van Maaren
PODC
2006
ACM
14 years 1 months ago
Optimal-stretch name-independent compact routing in doubling metrics
We consider the problem of name-independent routing in doubling metrics. A doubling metric is a metric space whose doubling dimension is a constant, where the doubling dimension o...
Goran Konjevod, Andréa W. Richa, Donglin Xi...
PLDI
2005
ACM
14 years 1 months ago
Jungloid mining: helping to navigate the API jungle
Reuse of existing code from class libraries and frameworks is often difficult because APIs are complex and the client code required to use the APIs can be hard to write. We obser...
David Mandelin, Lin Xu, Rastislav Bodík, Do...