Sciweavers

6562 search results - page 256 / 1313
» Noetherianity and Combination Problems
Sort
View
ISAAC
2005
Springer
127views Algorithms» more  ISAAC 2005»
16 years 4 days ago
Decision Making Based on Approximate and Smoothed Pareto Curves
Abstract. We consider bicriteria optimization problems and investigate the relationship between two standard approaches to solving them: (i) computing the Pareto curve and (ii) the...
Heiner Ackermann, Alantha Newman, Heiko Rögli...
ICCV
2009
IEEE
16 years 11 months ago
Subspace matching: Unique solutions to point matching with geometric constraints
Finding correspondences between feature points is one of the most relevant problems in the whole set of visual tasks. In this paper we address the problem of matching a feature ...
Manuel Marques, Marko Stosic and Joao Costeira
CVPR
2007
IEEE
16 years 8 months ago
Online Spatial-temporal Data Fusion for Robust Adaptive Tracking
One problem with the adaptive tracking is that the data that are used to train the new target model often contain errors and these errors will affect the quality of the new target...
Jixu Chen, Qiang Ji
ICDE
1999
IEEE
140views Database» more  ICDE 1999»
16 years 8 months ago
Multiversion Reconciliation for Mobile Databases
As mobile computing devices become more and more popular, mobile databases have started gaining popularity. An important feature of these database systems is their ability to allo...
Shirish Hemant Phatak, B. R. Badrinath
ICPR
2008
IEEE
16 years 7 months ago
Training sequential on-line boosting classifier for visual tracking
On-line boosting allows to adapt a trained classifier to changing environmental conditions or to use sequentially available training data. Yet, two important problems in the on-li...
Helmut Grabner, Horst Bischof, Jan Sochman, Jiri M...