Sciweavers

17760 search results - page 3302 / 3552
» A Generalization of the Massey-Ding Algorithm
Sort
View
PASTE
2010
ACM
15 years 9 months ago
Learning universal probabilistic models for fault localization
Recently there has been significant interest in employing probabilistic techniques for fault localization. Using dynamic dependence information for multiple passing runs, learnin...
Min Feng, Rajiv Gupta
PLDI
2010
ACM
15 years 9 months ago
Line-up: a complete and automatic linearizability checker
Modular development of concurrent applications requires threadsafe components that behave correctly when called concurrently by multiple client threads. This paper focuses on line...
Sebastian Burckhardt, Chris Dern, Madanlal Musuvat...
PODS
2010
ACM
173views Database» more  PODS 2010»
15 years 9 months ago
Foundations of schema mapping management
In the last few years, a lot of attention has been paid to the specification and subsequent manipulation of schema mappings, a problem which is of fundamental importance in metad...
Marcelo Arenas, Jorge Pérez, Juan L. Reutte...
ECCV
2010
Springer
15 years 8 months ago
Detecting ground shadows in outdoor consumer photographs
Detecting shadows from images can significantly improve the performance of several vision tasks such as object detection and tracking. Recent approaches have mainly used illuminat...
159
Voted
STOC
2010
ACM
295views Algorithms» more  STOC 2010»
15 years 8 months ago
Approximation Schemes for Steiner Forest on Planar Graphs and Graphs of Bounded Treewidth
We give the first polynomial-time approximation scheme (PTAS) for the Steiner forest problem on planar graphs and, more generally, on graphs of bounded genus. As a first step, w...
MohammadHossein Bateni, MohammadTaghi Hajiaghayi a...
« Prev « First page 3302 / 3552 Last » Next »