Sciweavers

1399 search results - page 247 / 280
» Multi-party Finite Computations
Sort
View
IJCV
2002
111views more  IJCV 2002»
13 years 8 months ago
Linear Multi View Reconstruction and Camera Recovery Using a Reference Plane
This paper presents a linear algorithm for simultaneous computation of 3D points and camera positions from multiple perspective views based on having a reference plane visible in a...
Carsten Rother, Stefan Carlsson
TC
2002
13 years 8 months ago
Fast Asynchronous Uniform Consensus in Real-Time Distributed Systems
We investigate whether asynchronous computational models and asynchronous algorithms can be considered for designing real-time distributed fault-tolerant systems. A priori, the lac...
Jean-François Hermant, Gérard Le Lan...
COLT
2010
Springer
13 years 6 months ago
An Asymptotically Optimal Bandit Algorithm for Bounded Support Models
Multiarmed bandit problem is a typical example of a dilemma between exploration and exploitation in reinforcement learning. This problem is expressed as a model of a gambler playi...
Junya Honda, Akimichi Takemura
ISAAC
2010
Springer
253views Algorithms» more  ISAAC 2010»
13 years 6 months ago
Solving Two-Stage Stochastic Steiner Tree Problems by Two-Stage Branch-and-Cut
Abstract. We consider the Steiner tree problem under a 2-stage stochastic model with recourse and finitely many scenarios (SSTP). Thereby, edges are purchased in the first stage wh...
Immanuel M. Bomze, Markus Chimani, Michael Jü...
PKDD
2010
Springer
164views Data Mining» more  PKDD 2010»
13 years 6 months ago
Complexity Bounds for Batch Active Learning in Classification
Active learning [1] is a branch of Machine Learning in which the learning algorithm, instead of being directly provided with pairs of problem instances and their solutions (their l...
Philippe Rolet, Olivier Teytaud