Sciweavers

2370 search results - page 157 / 474
» The Characterization of Data-Accumulating Algorithms
Sort
View
POPL
2011
ACM
14 years 28 days ago
Making prophecies with decision predicates
We describe a new algorithm for proving temporal properties expressed in LTL of infinite-state programs. Our approach takes advantage of the fact that LTL properties can often be...
Byron Cook, Eric Koskinen
SIGMETRICS
2011
ACM
237views Hardware» more  SIGMETRICS 2011»
14 years 27 days ago
Analysis of DCTCP: stability, convergence, and fairness
Cloud computing, social networking and information networks (for search, news feeds, etc) are driving interest in the deployment of large data centers. TCP is the dominant Layer 3...
Mohammad Alizadeh, Adel Javanmard, Balaji Prabhaka...
TON
2012
13 years 16 days ago
Exploiting Data Fusion to Improve the Coverage of Wireless Sensor Networks
Abstract—Wireless sensor networks (WSNs) have been increasingly available for critical applications such as security surveillance and environmental monitoring. An important perfo...
Rui Tan, Guoliang Xing, Benyuan Liu, Jianping Wang...
KDD
2002
ACM
146views Data Mining» more  KDD 2002»
15 years 10 months ago
Closed Set Mining of Biological Data
We present a closed set data mining paradigm which is particularly e ective for uncovering the kind of deterministic, causal dependencies that characterize much of basic science. ...
John L. Pfaltz, Christopher M. Taylor
ALT
2006
Springer
15 years 7 months ago
Teaching Memoryless Randomized Learners Without Feedback
The present paper mainly studies the expected teaching time of memoryless randomized learners without feedback. First, a characterization of optimal randomized learners is provided...
Frank J. Balbach, Thomas Zeugmann