Sciweavers

2060 search results - page 110 / 412
» Some Applications of Coding Theory in Computational Complexi...
Sort
View
ASPLOS
2008
ACM
15 years 6 months ago
Optimistic parallelism benefits from data partitioning
Recent studies of irregular applications such as finite-element mesh generators and data-clustering codes have shown that these applications have a generalized data parallelism ar...
Milind Kulkarni, Keshav Pingali, Ganesh Ramanaraya...
KDD
2008
ACM
156views Data Mining» more  KDD 2008»
16 years 4 months ago
Can complex network metrics predict the behavior of NBA teams?
The United States National Basketball Association (NBA) is one of the most popular sports league in the world and is well known for moving a millionary betting market that uses th...
Antonio Alfredo Ferreira Loureiro, Pedro O. S. Vaz...
FOCS
2003
IEEE
15 years 9 months ago
List-Decoding Using The XOR Lemma
We show that Yao’s XOR Lemma, and its essentially equivalent rephrasing as a Direct Product Lemma, can be re-interpreted as a way of obtaining error-correcting codes with good l...
Luca Trevisan
MOBIHOC
2010
ACM
15 years 2 months ago
Data preservation under spatial failures in sensor networks
In this paper, we address the problem of preserving generated data in a sensor network in case of node failures. We focus on the type of node failures that have explicit spatial s...
Navid Hamed Azimi, Himanshu Gupta, Xiaoxiao Hou, J...
CMSB
2006
Springer
15 years 8 months ago
Probabilistic Model Checking of Complex Biological Pathways
Abstract. Probabilistic model checking is a formal verification technique that has been successfully applied to the analysis of systems from a broad range of domains, including sec...
John Heath, Marta Z. Kwiatkowska, Gethin Norman, D...