Sciweavers

4377 search results - page 121 / 876
» Mass problems and randomness
Sort
View
MOC
1998
144views more  MOC 1998»
15 years 6 months ago
Convergence of a random walk method for a partial differential equation
Abstract. A Cauchy problem for a one–dimensional diffusion–reaction equation is solved on a grid by a random walk method, in which the diffusion part is solved by random walk...
Weidong Lu
APPROX
1998
Springer
150views Algorithms» more  APPROX 1998»
15 years 10 months ago
Approximating Circular Arc Colouring and Bandwidth Allocation in All-Optical Ring Networks
We present randomized approximation algorithms for the circular arc graph colouring problem and for the problem of bandwidth allocation in all-optical ring networks. We obtain a fa...
Vijay Kumar
ICEIS
1999
IEEE
15 years 10 months ago
Contour Estimation on Piecewise Homogeneous Random Fields
: Contour Estimation, Bayesian Estimation, Random Fields, Dynamic Programming, Multigrid Methods. This paper addresses contour estimation on images modeled as piecewise homogeneous...
José A. Moinhos Cordeiro, José M. B....
IJCV
2006
206views more  IJCV 2006»
15 years 6 months ago
Random Sampling for Subspace Face Recognition
Subspacefacerecognitionoftensuffersfromtwoproblems:(1)thetrainingsamplesetissmallcompared with the high dimensional feature vector; (2) the performance is sensitive to the subspace...
Xiaogang Wang, Xiaoou Tang
JAIR
2007
95views more  JAIR 2007»
15 years 6 months ago
Consistency and Random Constraint Satisfaction Models
In this paper, we study the possibility of designing non-trivial random CSP models by exploiting the intrinsic connection between structures and typical-case hardness. We show tha...
Yong Gao, Joseph C. Culberson