Sciweavers

1447 search results - page 276 / 290
» Graphs and Path Equilibria
Sort
View
SODA
2012
ACM
253views Algorithms» more  SODA 2012»
12 years 2 days ago
Kernelization of packing problems
Kernelization algorithms are polynomial-time reductions from a problem to itself that guarantee their output to have a size not exceeding some bound. For example, d-Set Matching f...
Holger Dell, Dániel Marx
GIS
2009
ACM
14 years 10 months ago
Map-Matching for Low-Sampling-Rate GPS Trajectories
Map-matching is the process of aligning a sequence of observed user positions with the road network on a digital map. It is a fundamental pre-processing step for many applications...
Yin Lou, Chengyang Zhang, Yu Zheng, Xing Xie, Wei ...
PPOPP
2009
ACM
14 years 10 months ago
Idempotent work stealing
Load balancing is a technique which allows efficient parallelization of irregular workloads, and a key component of many applications and parallelizing runtimes. Work-stealing is ...
Maged M. Michael, Martin T. Vechev, Vijay A. Saras...
POPL
2010
ACM
14 years 7 months ago
Continuity Analysis of Programs
We present an analysis to automatically determine if a program represents a continuous function, or equivalently, if infinitesimal changes to its inputs can only cause infinitesim...
Swarat Chaudhuri, Sumit Gulwani, Roberto Lublinerm...
PEPM
2010
ACM
14 years 6 months ago
Conditional weighted pushdown systems and applications
Pushdown systems are well understood as abstract models of programs with (recursive) procedures. Reps et al. recently extended pushdown systems into weighted pushdown systems, whi...
Xin Li, Mizuhito Ogawa