Sciweavers

1603 search results - page 7 / 321
» Universal Confidence Sets for Solutions of Optimization Prob...
Sort
View
CVPR
2009
IEEE
16 years 5 months ago
Efficient Reduction of L-infinity Geometry Problems
This paper presents a new method for computing optimal L1 solutions for vision geometry problems, particularly for those problems of fixed-dimension and of large-scale. Our strat...
Hongdong Li (Australian National University)
ECCV
1998
Springer
15 years 11 months ago
A Solution for the Registration of Multiple 3D Point Sets Using Unit Quaternions
Registering 3D point sets is a common problem in computer vision. The case of two point sets has been analytically well solved by several authors. In this paper we present an analy...
Raouf Benjemaa, Francis Schmitt
BMCBI
2008
95views more  BMCBI 2008»
14 years 10 months ago
Universal seeds for cDNA-to-genome comparison
Background: To meet the needs of gene annotation for newly sequenced organisms, optimized spaced seeds can be implemented into cross-species sequence alignment programs to accurat...
Leming Zhou, Jonathan Stanton, Liliana Florea
FOCS
2005
IEEE
15 years 3 months ago
How to Pay, Come What May: Approximation Algorithms for Demand-Robust Covering Problems
Robust optimization has traditionally focused on uncertainty in data and costs in optimization problems to formulate models whose solutions will be optimal in the worstcase among ...
Kedar Dhamdhere, Vineet Goyal, R. Ravi, Mohit Sing...
ICML
2007
IEEE
15 years 10 months ago
Efficiently computing minimax expected-size confidence regions
Given observed data and a collection of parameterized candidate models, a 1- confidence region in parameter space provides useful insight as to those models which are a good fit t...
Brent Bryan, H. Brendan McMahan, Chad M. Schafer, ...