Sciweavers

3820 search results - page 560 / 764
» Bounded Model Debugging
Sort
View
APSCC
2009
IEEE
15 years 9 months ago
On analyzing and specifying concerns for data as a service
—Providing data as a service has not only fostered the access to data from anywhere at anytime but also reduced the cost of investment. However, data is often associated with var...
Hong Linh Truong, Schahram Dustdar
KDD
2009
ACM
146views Data Mining» more  KDD 2009»
15 years 9 months ago
Online allocation of display advertisements subject to advanced sales contracts
In this paper we propose a utility model that accounts for both sales and branding advertisers. We first study the computational complexity of optimization problems related to bo...
Saeed Alaei, Esteban Arcaute, Samir Khuller, Wenji...
ALGOSENSORS
2009
Springer
15 years 9 months ago
Compressing Kinetic Data from Sensor Networks
We introduce a framework for storing and processing kinetic data observed by sensor networks. These sensor networks generate vast quantities of data, which motivates a significant...
Sorelle A. Friedler, David M. Mount
WADS
2009
Springer
223views Algorithms» more  WADS 2009»
15 years 9 months ago
Fault Tolerant External Memory Algorithms
Abstract. Algorithms dealing with massive data sets are usually designed for I/O-efficiency, often captured by the I/O model by Aggarwal and Vitter. Another aspect of dealing with ...
Gerth Stølting Brodal, Allan Grønlun...
SAT
2009
Springer
153views Hardware» more  SAT 2009»
15 years 9 months ago
Does Advice Help to Prove Propositional Tautologies?
One of the starting points of propositional proof complexity is the seminal paper by Cook and Reckhow [6], where they defined propositional proof systems as poly-time computable f...
Olaf Beyersdorff, Sebastian Müller