Sciweavers

245 search results - page 47 / 49
» The Iterated Weakest Link
Sort
View
NSDI
2004
14 years 11 months ago
Designing a DHT for Low Latency and High Throughput
Designing a wide-area distributed hash table (DHT) that provides high-throughput and low-latency network storage is a challenge. Existing systems have explored a range of solution...
Frank Dabek, Jinyang Li, Emil Sit, James Robertson...
UAI
2004
14 years 11 months ago
Recovering Articulated Object Models from 3D Range Data
We address the problem of unsupervised learning of complex articulated object models from 3D range data. We describe an algorithm whose input is a set of meshes corresponding to d...
Dragomir Anguelov, Daphne Koller, Hoi-Cheung Pang,...
86
Voted
BMCBI
2008
138views more  BMCBI 2008»
14 years 9 months ago
CASCADE: a novel quasi all paths-based network analysis algorithm for clustering biological interactions
Background: Quantitative characterization of the topological characteristics of protein-protein interaction (PPI) networks can enable the elucidation of biological functional modu...
Woochang Hwang, Young-Rae Cho, Aidong Zhang, Mural...
BMCBI
2007
140views more  BMCBI 2007»
14 years 9 months ago
Prediction potential of candidate biomarker sets identified and validated on gene expression data from multiple datasets
Background: Independently derived expression profiles of the same biological condition often have few genes in common. In this study, we created populations of expression profiles...
Michael Gormley, William Dampier, Adam Ertel, Bilg...
135
Voted
IJCV
2006
299views more  IJCV 2006»
14 years 9 months ago
Graph Cuts and Efficient N-D Image Segmentation
Combinatorial graph cut algorithms have been successfully applied to a wide range of problems in vision and graphics. This paper focusses on possibly the simplest application of gr...
Yuri Boykov, Gareth Funka-Lea