Sciweavers

916 search results - page 42 / 184
» Using redundancies to find errors
Sort
View
ECCC
2006
109views more  ECCC 2006»
13 years 11 months ago
How to rank with few errors: A PTAS for Weighted Feedback Arc Set on Tournaments
Suppose you ran a chess tournament, everybody played everybody, and you wanted to use the results to rank everybody. Unless you were really lucky, the results would not be acyclic...
Claire Kenyon-Mathieu, Warren Schudy
BMCBI
2010
130views more  BMCBI 2010»
13 years 11 months ago
A statistical approach to finding overlooked genetic associations
Background: Complexity and noise in expression quantitative trait loci (eQTL) studies make it difficult to distinguish potential regulatory relationships among the many interactio...
Andrew K. Rider, Geoffrey Siwo, Nitesh V. Chawla, ...
SIGSOFT
2010
ACM
13 years 8 months ago
Finding latent performance bugs in systems implementations
Robust distributed systems commonly employ high-level recovery mechanisms enabling the system to recover from a wide variety of problematic environmental conditions such as node f...
Charles Edwin Killian, Karthik Nagaraj, Salman Per...
VTC
2008
IEEE
127views Communications» more  VTC 2008»
14 years 5 months ago
Performance Evaluation of Joint FEC and ARQ Optimization Heuristic Algorithms under Gilbert-Elliot Wireless Channel
— In this paper, we evaluate the performance of adaptive algorithms for selecting the number of redundant packets by jointly considering the forward error correction (FEC) and au...
Azfar Moid, Abraham O. Fapojuwo
CCR
2002
98views more  CCR 2002»
13 years 10 months ago
Efficient flooding with Passive Clustering (PC) in ad hoc networks
An ad hoc network is a fast deployable selfconfiguring wireless network characterized by node mobility, dynamic topology structure, unreliable media and limited power supply. Node...
Taek Jin Kwon, Mario Gerla