Sciweavers

1299 search results - page 86 / 260
» Computing Minimal Diagnoses with Critical Set Algorithms
Sort
View
COMPGEOM
2006
ACM
15 years 3 months ago
Algorithms for two-box covering
We study the problem of covering a set of points or polyhedra in 3 with two axis-aligned boxes in order to minimize a function of the measures of the two boxes, such as the sum or...
Esther M. Arkin, Gill Barequet, Joseph S. B. Mitch...
SKG
2006
IEEE
15 years 3 months ago
Hierarchical Multicast Tree Algorithms of Data Grid
Data Grid is one of the important research subjects in the field of Grid Computing. To get a high efficiency of the system, this paper proposes a set of novel multicast algorithms...
Weijia Jia, Qingfeng Fan, Qiongli Wu, Yanxiang He
IJAIT
2006
121views more  IJAIT 2006»
14 years 9 months ago
An Efficient Feature Selection Algorithm for Computer-aided Polyp Detection
We present an efficient feature selection algorithm for computer aided detection (CAD) computed tomographic (CT) colonography. The algorithm 1) determines an appropriate piecewise...
Jiang Li, Jianhua Yao, Ronald M. Summers, Nicholas...
CVPR
2011
IEEE
14 years 1 months ago
A Brute-Force Algorithm for Reconstructing a Scene from Two Projections
Is the real problem in finding the relative orientation of two viewpoints the correspondence problem? We argue that this is only one difficulty. Even with known correspondences,...
Olof Enqvist, Fangyuan Jiang, Fredrik Kahl
EUROPAR
2010
Springer
14 years 10 months ago
A Fast 5/2-Approximation Algorithm for Hierarchical Scheduling
We present in this article a new approximation algorithm for scheduling a set of n independent rigid (meaning requiring a fixed number of processors) jobs on hierarchical parallel ...
Marin Bougeret, Pierre-François Dutot, Klau...