Sciweavers

2693 search results - page 488 / 539
» On Computing Complex Navigation Functions
Sort
View
COMPGEOM
2006
ACM
15 years 8 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...
157
Voted
PODC
2006
ACM
15 years 8 months ago
Optimal-stretch name-independent compact routing in doubling metrics
We consider the problem of name-independent routing in doubling metrics. A doubling metric is a metric space whose doubling dimension is a constant, where the doubling dimension o...
Goran Konjevod, Andréa W. Richa, Donglin Xi...
CCGRID
2005
IEEE
15 years 8 months ago
Performance evaluation of JXTA communication layers
— The arrival of the P2P model has opened many new avenues for research within the field of distributed computing. This is mainly due to important practical features (such as su...
Gabriel Antoniu, Philip J. Hatcher, Mathieu Jan, D...
149
Voted
CVPR
2010
IEEE
15 years 5 months ago
Ray Markov Random Fields for Image-Based 3D Modeling: Model and Efficient Inference
In this paper, we present an approach to multi-view image-based 3D reconstruction by statistically inversing the ray-tracing based image generation process. The proposed algorithm...
Shubao Liu, David Cooper
AICT
2008
IEEE
119views Communications» more  AICT 2008»
15 years 2 months ago
Simplification of Frequency Test for Random Number Generation Based on Chi-Square
This paper presents the simplified method of random test suite based on the frequency (block) test. The test is used to check the first property of random numbers which is to have ...
Kruawan Wongpanya, Keattisak Sripimanwat, Kanok Je...