Sciweavers

3007 search results - page 446 / 602
» Linear Functional Fixed-points
Sort
View
IJCV
2006
125views more  IJCV 2006»
15 years 3 months ago
Robust Tracking Using Foreground-Background Texture Discrimination
This paper conceives of tracking as the developing distinction of a foreground against the background. In this manner, fast changes in the object or background appearance can be de...
Hieu Tat Nguyen, Arnold W. M. Smeulders
JCT
2006
100views more  JCT 2006»
15 years 3 months ago
Enumeration of unrooted maps of a given genus
Let Ng(f ) denote the number of rooted maps of genus g having f edges. An exact formula for Ng(f ) is known for g = 0 (Tutte, 1963), g = 1 (Arques, 1987), g = 2,3 (Bender and Canf...
Alexander Mednykh, Roman Nedela
AI
1998
Springer
15 years 2 months ago
Model-Based Average Reward Reinforcement Learning
Reinforcement Learning (RL) is the study of programs that improve their performance by receiving rewards and punishments from the environment. Most RL methods optimize the discoun...
Prasad Tadepalli, DoKyeong Ok
CGF
1998
118views more  CGF 1998»
15 years 2 months ago
An Exhaustive Error-Bounding Algorithm for Hierarchical Radiosity
This paper presents a complete algorithm for the evaluation and control of error in radiosity calculations. Providing such control is both extremely important for industrial appli...
Nicolas Holzschuch, François X. Sillion
MP
2002
195views more  MP 2002»
15 years 2 months ago
Nonlinear rescaling vs. smoothing technique in convex optimization
We introduce an alternative to the smoothing technique approach for constrained optimization. As it turns out for any given smoothing function there exists a modification with part...
Roman A. Polyak