Sciweavers

1871 search results - page 168 / 375
» The Ephemeral Pairing Problem
Sort
View
ALT
1999
Springer
15 years 11 months ago
On the Uniform Learnability of Approximations to Non-Recursive Functions
Abstract. Blum and Blum (1975) showed that a class B of suitable recursive approximations to the halting problem is reliably EX-learnable. These investigations are carried on by sh...
Frank Stephan, Thomas Zeugmann
ECCV
2010
Springer
15 years 10 months ago
Bundle Adjustment in the Large
Abstract. We present the design and implementation of a new inexact Newton type algorithm for solving large-scale bundle adjustment problems with tens of thousands of images. We ex...
APPROX
2006
Springer
124views Algorithms» more  APPROX 2006»
15 years 10 months ago
Combinatorial Algorithms for Data Migration to Minimize Average Completion Time
The data migration problem is to compute an efficient plan for moving data stored on devices in a network from one configuration to another. It is modeled by a transfer graph, wher...
Rajiv Gandhi, Julián Mestre
DCOSS
2010
Springer
15 years 10 months ago
Approximate Distributed Kalman Filtering for Cooperative Multi-agent Localization
Abstract. We consider the problem of estimating the locations of mobile agents by fusing the measurements of displacements of the agents as well as relative position measurements b...
Prabir Barooah, Wm. Joshua Russell, João P....
ECCV
2010
Springer
15 years 9 months ago
Learning PDEs for Image Restoration via Optimal Control
Partial differential equations (PDEs) have been successfully applied to many computer vision and image processing problems. However, designing PDEs requires high mathematical skill...