Sciweavers

15073 search results - page 363 / 3015
» Probabilistic algorithms for computing resultants
Sort
View
152
Voted
ICPR
2000
IEEE
16 years 6 months ago
Feature Relevance Learning with Query Shifting for Content-Based Image Retrieval
Probabilistic feature relevance learning (PFRL) is an effective technique for adaptively computing local feature relevance for content-based image retrieval. It however becomes le...
Douglas R. Heisterkamp, Jing Peng, H. K. Dai
149
Voted
KBSE
2010
IEEE
15 years 3 months ago
A bounded statistical approach for model checking of unbounded until properties
We study the problem of statistical model checking of probabilistic systems for PCTL unbounded until property P1p(ϕ1 U ϕ2) (where 1 ∈ {<, ≤, >, ≥}) using the computa...
Ru He, Paul Jennings, Samik Basu, Arka P. Ghosh, H...
ASIAN
2004
Springer
180views Algorithms» more  ASIAN 2004»
15 years 10 months ago
Counting by Coin Tossings
Abstract. This text is an informal review of several randomized algorithms that have appeared over the past two decades and have proved instrumental in extracting efficiently quant...
Philippe Flajolet
165
Voted
SIGGRAPH
1992
ACM
15 years 9 months ago
Interval analysis for computer graphics
This paper discusses how interval analysis can be used to solve a wide variety of problems in computer graphics. These problems include ray tracing, interference detection, polygo...
John M. Snyder
128
Voted
GREC
2009
Springer
15 years 8 months ago
A Performance Characterization Algorithm for Symbol Localization
In this paper we present an algorithm for performance characterization of symbol localization systems. This algorithm is aimed to be a more “reliable” and “open” solution t...
Mathieu Delalandre, Jean-Yves Ramel, Ernest Valven...