Sciweavers

1486 search results - page 207 / 298
» Algorithms for two-box covering
Sort
View
3DPVT
2004
IEEE
166views Visualization» more  3DPVT 2004»
15 years 8 months ago
Multi-Camera Reconstruction based on Surface Normal Estimation and Best Viewpoint Selection
In this paper, we present a new algorithm for reconstructing an environment from images recorded by multiple calibrated cameras. Multiple camera systems challenge traditional ster...
Xenophon Zabulis, Kostas Daniilidis
ICFP
1997
ACM
15 years 8 months ago
The Effectiveness of Flow Analysis for Inlining
An interprocedural flow analysis can justify inlining in higher-order languages. In principle, more inlining can be performed as analysis accuracy improves. This paper compares fo...
J. Michael Ashley
NIPS
2008
15 years 6 months ago
On the Complexity of Linear Prediction: Risk Bounds, Margin Bounds, and Regularization
This work characterizes the generalization ability of algorithms whose predictions are linear in the input vector. To this end, we provide sharp bounds for Rademacher and Gaussian...
Sham M. Kakade, Karthik Sridharan, Ambuj Tewari
ADHOC
2008
101views more  ADHOC 2008»
15 years 4 months ago
Monte Carlo localization for mobile wireless sensor networks
Localization is crucial to many applications in wireless sensor networks. In this article, we propose a range-free anchorbased localization algorithm for mobile wireless sensor ne...
Aline Baggio, Koen Langendoen
CORR
2010
Springer
122views Education» more  CORR 2010»
15 years 4 months ago
How to meet asynchronously (almost) everywhere
Two mobile agents (robots) with distinct labels have to meet in an arbitrary, possibly infinite, unknown connected graph or in an unknown connected terrain in the plane. Agents ar...
Jurek Czyzowicz, Arnaud Labourel, Andrzej Pelc