Sciweavers

1434 search results - page 218 / 287
» Stochastic computation
Sort
View
ICPR
2008
IEEE
15 years 10 months ago
Approximation of salient contours in cluttered scenes
This paper proposes a new approach to describe the salient contours in cluttered scenes. No need to do the preprocessing, such as edge detection, we directly use a set of random s...
Rui Huang, Nong Sang, Qiling Tang
ICPR
2008
IEEE
15 years 10 months ago
Adaptive nonstationary regression analysis
The problem of finding the most appropriate subset of features or regressors is the generic challenge of Machine Learning problems like regression estimation or pattern recognitio...
Olga Krasotkina, Vadim Mottl
FOCI
2007
IEEE
15 years 10 months ago
Almost All Learning Machines are Singular
— A learning machine is called singular if its Fisher information matrix is singular. Almost all learning machines used in information processing are singular, for example, layer...
Sumio Watanabe
HPDC
2007
IEEE
15 years 10 months ago
A provisioning model and its comparison with best-effort for performance-cost optimization in grids
The resource availability in Grids is generally unpredictable due to the autonomous and shared nature of the Grid resources and stochastic nature of the workload resulting in a be...
Gurmeet Singh, Carl Kesselman, Ewa Deelman
ICC
2007
IEEE
124views Communications» more  ICC 2007»
15 years 10 months ago
Optimal Scheduling Policy Determination for High Speed Downlink Packet Access
— In this paper, we present an analytic model and methodology to determine optimal scheduling policy that involves two dimension space allocation: time and code, in High Speed Do...
Hussein Al-Zubaidy, Jerome Talim, Ioannis Lambadar...