Sciweavers

334 search results - page 55 / 67
» Concurrency Among Strangers
Sort
View
NFM
2011
223views Formal Methods» more  NFM 2011»
13 years 4 months ago
Generating Data Race Witnesses by an SMT-Based Analysis
Abstract. Data race is one of the most dangerous errors in multithreaded programming, and despite intensive studies, it remains a notorious cause of failures in concurrent systems....
Mahmoud Said, Chao Wang, Zijiang Yang, Karem Sakal...
WINET
2011
13 years 4 months ago
High performance, low complexity cooperative caching for wireless sensor networks
During the last decade, Wireless Sensor Networks (WSNs) have emerged and matured at such point that currently support several applications like environment control, intelligent bu...
Nikos Dimokas, Dimitrios Katsaros, Leandros Tassiu...
IFIP
2010
Springer
13 years 4 months ago
Reasoning about Probabilistic Security Using Task-PIOAs
Abstract. Task-structured probabilistic input/output automata (taskPIOAs) are concurrent probabilistic automata that, among other things, have been used to provide a formal framewo...
Aaron D. Jaggard, Catherine Meadows, Michael Mislo...
TASLP
2010
109views more  TASLP 2010»
13 years 4 months ago
Multipitch Estimation of Piano Sounds Using a New Probabilistic Spectral Smoothness Principle
Abstract--A new method for the estimation of multiple concurrent pitches in piano recordings is presented. It addresses the issue of overlapping overtones by modeling the spectral ...
Valentin Emiya, Roland Badeau, Bertrand David
TDSC
2010
160views more  TDSC 2010»
13 years 4 months ago
Dual-Quorum: A Highly Available and Consistent Replication System for Edge Services
This paper introduces dual-quorum replication, a novel data replication algorithm designed to support Internet edge services. Edge services allow clients to access Internet service...
Lei Gao, Michael Dahlin, Jiandan Zheng, Lorenzo Al...