7519 search results - page 243 / 1504 » Optimizing Generic Functions |
192
click to vote
SEBD
1997
15 years 7 months ago
1997
M-tree is a dynamic access method suitable to index generic “metric spaces”, where the function used to compute the distance between any two objects satisfies the positivity, ...
199
click to vote
AAAI
2006
15 years 8 months ago
2006
Reinforcement learning problems are commonly tackled with temporal difference methods, which attempt to estimate the agent's optimal value function. In most real-world proble...
166
click to vote
CAIP
1999
Springer
1999
Springer
EigenHistograms: Using Low Dimensional Models of Color Distribution for Real Time Object Recognition
15 years 10 months ago
Abstract. Distribution of object colors has been used in computer vision for recognition and indexing. Most of the recent approaches to this problem have been focused on de ning op...
148
click to vote
ATMOS
2010
15 years 5 months ago
2010
Calculating timetables that are insensitive to disturbances has drawn considerable research efforts due to its practical importance on the one hand and its hard tractability by c...
170
click to vote
CVPR
2006
IEEE
16 years 8 months ago
2006
IEEE
Recently, many global stereo methods have achieved good results by modeling a disparity surface as a Markov random field (MRF) and by solving an optimization problem with various ...