Sciweavers

1060 search results - page 154 / 212
» On the Discovery of Random Trees
Sort
View
STOC
1996
ACM
115views Algorithms» more  STOC 1996»
15 years 2 months ago
Minimum Cuts in Near-Linear Time
We significantly improve known time bounds for solving the minimum cut problem on undirected graphs. We use a "semiduality" between minimum cuts and maximum spanning tree...
David R. Karger
STOC
2007
ACM
101views Algorithms» more  STOC 2007»
15 years 10 months ago
The price of privacy and the limits of LP decoding
This work is at the intersection of two lines of research. One line, initiated by Dinur and Nissim, investigates the price, in accuracy, of protecting privacy in a statistical dat...
Cynthia Dwork, Frank McSherry, Kunal Talwar
105
Voted
BMCBI
2010
190views more  BMCBI 2010»
14 years 10 months ago
Sample size and statistical power considerations in high-dimensionality data settings: a comparative study of classification alg
Background: Data generated using `omics' technologies are characterized by high dimensionality, where the number of features measured per subject vastly exceeds the number of...
Yu Guo, Armin Graber, Robert N. McBurney, Raji Bal...
BMCBI
2002
136views more  BMCBI 2002»
14 years 10 months ago
Making sense of EST sequences by CLOBBing them
Background: Expressed sequence tags (ESTs) are single pass reads from randomly selected cDNA clones. They provide a highly cost-effective method to access and identify expressed g...
John Parkinson, David B. Guiliano, Mark L. Blaxter
ICCAD
2002
IEEE
161views Hardware» more  ICCAD 2002»
15 years 7 months ago
Non-tree routing for reliability and yield improvement
We propose to introduce redundant interconnects for manufacturing yield and reliability improvement. By introducing redundant interconnects, the potential for open faults is reduc...
Andrew B. Kahng, Bao Liu, Ion I. Mandoiu