1603 search results - page 17 / 321 » Universal Confidence Sets for Solutions of Optimization Prob... |
ICIP
2008
IEEE
15 years 4 months ago
2008
IEEE
Widely used SVD-based matrix factorization approaches to the recovery of 3D rigid structure from motion (SFM), require a set of feature points to be visible in a set of images. Wh...
COR
2006
14 years 10 months ago
2006
Several approximation algorithms with proven performance guarantees have been proposed to find approximate solutions to classical combinatorial optimization problems. However, the...
CRYPTO
2000
Springer
15 years 2 months ago
2000
Springer
In this work we use cryptography to solve a game-theoretic problem which arises naturally in the area of two party strategic games. The standard game-theoretic solution concept for...
DAGSTUHL
2004
14 years 11 months ago
2004
This paper summarizes the research issues in the area of XML data management and mobile transactions performed at the University of Paderborn. We shortly describe the problems wor...
TSMC
2011
14 years 4 months ago
2011
—The university course timetabling problem (UCTP) is a combinatorial optimization problem, in which a set of events has to be scheduled into time slots and located into suitable ...