Sciweavers

14548 search results - page 78 / 2910
» The Optimal Path-Matching Problem
Sort
View
CORR
2002
Springer
111views Education» more  CORR 2002»
13 years 9 months ago
The Fastest and Shortest Algorithm for All Well-Defined Problems
An algorithm M is described that solves any well-defined problem p as quickly as the fastest algorithm computing a solution to p, save for a factor of 5 and loworder additive term...
Marcus Hutter
IJCV
2000
133views more  IJCV 2000»
13 years 9 months ago
Heteroscedastic Regression in Computer Vision: Problems with Bilinear Constraint
We present an algorithm to estimate the parameters of a linear model in the presence of heteroscedastic noise, i.e., each data point having a different covariance matrix. The algor...
Yoram Leedan, Peter Meer
INFOCOM
2010
IEEE
13 years 8 months ago
Energy Efficient Algorithms for the RFID Estimation Problem
RFID has been gaining popularity for inventory control, object tracking, and supply chain management in warehouses, retail stores, hospitals, etc. Periodically and automatically es...
Tao Li, Samuel Wu, Shigang Chen, Mark Yang
ISICA
2007
Springer
14 years 4 months ago
A New Evolutionary Decision Theory for Many-Objective Optimization Problems
In this paper the authors point out that the Pareto Optimality is unfair, unreasonable and imperfect for Many-objective Optimization Problems (MOPs) underlying the hypothesis that ...
Zhuo Kang, Lishan Kang, Xiufen Zou, Minzhong Liu, ...
PAMI
2011
13 years 5 months ago
Dynamic Programming and Graph Algorithms in Computer Vision
Optimization is a powerful paradigm for expressing and solving problems in a wide range of areas, and has been successfully applied to many vision problems. Discrete optimization ...
Pedro F. Felzenszwalb, Ramin Zabih