Sciweavers

1019 search results - page 155 / 204
» A robust randomized algorithm to perform independent tasks
Sort
View
ICDM
2003
IEEE
158views Data Mining» more  ICDM 2003»
15 years 9 months ago
Identifying Markov Blankets with Decision Tree Induction
The Markov Blanket of a target variable is the minimum conditioning set of variables that makes the target independent of all other variables. Markov Blankets inform feature selec...
Lewis Frey, Douglas H. Fisher, Ioannis Tsamardinos...
PPOPP
2012
ACM
14 years 7 hour ago
Massively parallel breadth first search using a tree-structured memory model
Analysis of massive graphs has emerged as an important area for massively parallel computation. In this paper, it is shown how the Fresh Breeze trees-of-chunks memory model may be...
Tom St. John, Jack B. Dennis, Guang R. Gao
INFOCOM
2009
IEEE
15 years 11 months ago
Fair Routing in Delay Tolerant Networks
—The typical state-of-the-art routing algorithms for delay tolerant networks are based on best next hop hill-climbing heuristics in order to achieve throughput and efficiency. T...
Josep M. Pujol, Alberto Lopez Toledo, Pablo Rodrig...
CVPR
2007
IEEE
16 years 6 months ago
A Surface-Growing Approach to Multi-View Stereo Reconstruction
We present a new approach to reconstruct the shape of a 3D object or scene from a set of calibrated images. The central idea of our method is to combine the topological flexibilit...
Martin Habbecke, Leif Kobbelt
CVPR
2009
IEEE
16 years 11 months ago
Epitomized Priors for Multi-labeling Problems
Image parsing remains difficult due to the need to combine local and contextual information when labeling a scene. We approach this problem by using the epitome as a prior over ...
Jonathan Warrell, Simon J. D. Prince, Alastair P. ...