Sciweavers

2040 search results - page 264 / 408
» On the Complexity of Error Explanation
Sort
View
IPPS
2010
IEEE
15 years 3 months ago
Runtime checking of serializability in software transactional memory
Abstract--Ensuring the correctness of complex implementations of software transactional memory (STM) is a daunting task. Attempts have been made to formally verify STMs, but these ...
Arnab Sinha, Sharad Malik
281
Voted
INFOCOM
2012
IEEE
13 years 8 months ago
Approximate convex decomposition based localization in wireless sensor networks
—Accurate localization in wireless sensor networks is the foundation for many applications, such as geographic routing and position-aware data processing. An important research d...
Wenping Liu, Dan Wang, Hongbo Jiang, Wenyu Liu, Ch...
WWW
2004
ACM
16 years 6 months ago
A combined approach to checking web ontologies
The understanding of Semantic Web documents is built upon ontologies that define concepts and relationships of data. Hence, the correctness of ontologies is vital. Ontology reason...
Jin Song Dong, Chew Hung Lee, Hian Beng Lee, Yuan-...
ASPLOS
2009
ACM
16 years 6 months ago
Understanding software approaches for GPGPU reliability
Even though graphics processors (GPUs) are becoming increasingly popular for general purpose computing, current (and likely near future) generations of GPUs do not provide hardwar...
Martin Dimitrov, Mike Mantor, Huiyang Zhou
157
Voted
STOC
2005
ACM
96views Algorithms» more  STOC 2005»
16 years 6 months ago
Every monotone graph property is testable
A graph property is called monotone if it is closed under taking (not necessarily induced) subgraphs (or, equivalently, if it is closed under removal of edges and vertices). Many ...
Noga Alon, Asaf Shapira