Sciweavers

1552 search results - page 285 / 311
» On the Complexity of Constant Propagation
Sort
View
KDD
2007
ACM
191views Data Mining» more  KDD 2007»
16 years 5 days ago
Cost-effective outbreak detection in networks
Given a water distribution network, where should we place sensors to quickly detect contaminants? Or, which blogs should we read to avoid missing important stories? These seemingl...
Andreas Krause, Carlos Guestrin, Christos Faloutso...
VLSID
2006
IEEE
150views VLSI» more  VLSID 2006»
16 years 5 days ago
A Comprehensive SoC Design Methodology for Nanometer Design Challenges
SoC design methodologies are under constant revision due to adoption of fast shrinking process technologies at nanometer levels. Nanometer process geometries exhibit new complex d...
R. Raghavendra Kumar, Ricky Bedi, Ramadas Rajagopa...
POPL
2006
ACM
16 years 3 days ago
A hierarchical model of data locality
In POPL 2002, Petrank and Rawitz showed a universal result-finding optimal data placement is not only NP-hard but also impossible to approximate within a constant factor if P = NP...
Chengliang Zhang, Chen Ding, Mitsunori Ogihara, Yu...
RECOMB
2005
Springer
16 years 3 days ago
Reconstruction of Reticulate Networks from Gene Trees
Abstract. One of the simplest evolutionary models has molecular sequences evolving from a common ancestor down a bifurcating phylogenetic tree, experiencing point-mutations along t...
Daniel H. Huson, Tobias H. Klöpper, Pete J. L...
STOC
2007
ACM
137views Algorithms» more  STOC 2007»
16 years 3 days ago
Testing k-wise and almost k-wise independence
In this work, we consider the problems of testing whether a distribution over {0, 1}n is k-wise (resp. ( , k)-wise) independent using samples drawn from that distribution. For the...
Noga Alon, Alexandr Andoni, Tali Kaufman, Kevin Ma...