413 search results - page 50 / 83 » An abstract Monte-Carlo method for the analysis of probabili... |
CORR
2010
Springer
13 years 8 months ago
2010
Springer
Abstract--We apply Guo and Wang's relaxed belief propagation (BP) method to the estimation of a random vector from linear measurements followed by a componentwise probabilisti...
ICALP
2000
Springer
14 years 8 days ago
2000
Springer
Abstract. We obtain new results regarding the precise average bitcomplexity of five algorithms of a broad Euclidean type. We develop a general framework for analysis of algorithms,...
MLDM
2005
Springer
14 years 2 months ago
2005
Springer
We propose an unsupervised, probabilistic method for learning visual feature hierarchies. Starting from local, low-level features computed at interest point locations, the method c...
CC
2006
Springer
14 years 12 days ago
2006
Springer
Abstract. Profiling can effectively analyze program behavior and provide critical information for feedback-directed or dynamic optimizations. Based on memory profiling, reuse dista...
SAS
2005
Springer
14 years 2 months ago
2005
Springer
Abstract. In his seminal paper [5], Granger presents an analysis which infers linear congruence relations between integer variables. For affine programs without guards, his analys...