Sciweavers

1350 search results - page 228 / 270
» Reasoning about Staged Computation
Sort
View
STACS
2010
Springer
15 years 4 months ago
Beyond Bidimensionality: Parameterized Subexponential Algorithms on Directed Graphs
In 2000 Alber et al. [SWAT 2000 ] obtained the first parameterized subexponential algorithm on undirected planar graphs by showing that k-DOMINATING SET is solvable in time 2O( ...
Frederic Dorn, Fedor V. Fomin, Daniel Lokshtanov, ...
SIGMOD
1995
ACM
116views Database» more  SIGMOD 1995»
15 years 1 months ago
Incremental Maintenance of Views with Duplicates
We study the problem of e cient maintenance of materialized views that may contain duplicates. This problem is particularly important when queries against such views involve aggre...
Timothy Griffin, Leonid Libkin
MOBISYS
2010
ACM
15 years 4 days ago
Darwin phones: the evolution of sensing and inference on mobile phones
We present Darwin, an enabling technology for mobile phone sensing that combines collaborative sensing and classification techniques to reason about human behavior and context on ...
Emiliano Miluzzo, Cory Cornelius, Ashwin Ramaswamy...
POPL
2007
ACM
15 years 10 months ago
Program verification as probabilistic inference
In this paper, we propose a new algorithm for proving the validity or invalidity of a pre/postcondition pair for a program. The algorithm is motivated by the success of the algori...
Sumit Gulwani, Nebojsa Jojic
SPAA
2009
ACM
15 years 7 months ago
At-most-once semantics in asynchronous shared memory
Abstract. At-most-once semantics is one of the standard models for object access in decentralized systems. Accessing an object, such as altering the state of the object by means of...
Sotiris Kentros, Aggelos Kiayias, Nicolas C. Nicol...