Sciweavers

6251 search results - page 175 / 1251
» Randomness, Computability, and Density
Sort
View
TIP
2008
222views more  TIP 2008»
15 years 3 months ago
Local Region Descriptors for Active Contours Evolution
Edge-based and region-based active contours are frequently used in image segmentation. While edges characterize small neighborhoods of pixels, region descriptors characterize entir...
Cristina Darolti, Alfred Mertins, Christoph Bodens...
ICPR
2004
IEEE
16 years 5 months ago
Optimizing Nearest Neighbour in Random Subspaces using a Multi-Objective Genetic Algorithm
In this work, the authors have evaluated almost 20 millions ensembles of classifiers generated by several methods. Trying to optimize those ensembles based on the nearest neighbou...
Guillaume Tremblay, Robert Sabourin, Patrick Maupi...
112
Voted
CCA
2009
Springer
15 years 10 months ago
Random Iteration Algorithm for Graph-Directed Sets
Abstract. A random iteration algorithm for graph-directed sets is defined and discussed. Similarly to the Barnsley-Elton’s theorem, it is shown that almost all sequences obtaine...
Yoshiki Tsujii, Takakazu Mori, Mariko Yasugi, Hide...
SPAA
2010
ACM
15 years 8 months ago
Multi-sided shared coins and randomized set-agreement
This paper presents wait-free randomized algorithms for solving set-agreement in asynchronous shared-memory systems under a strong adversary. First, the definition of a shared-co...
Keren Censor Hillel
ISSAC
1997
Springer
105views Mathematics» more  ISSAC 1997»
15 years 8 months ago
On Randomized Lanczos Algorithms
Las Vegas algorithms that are based on Lanczos’s method for solving symmetric linear systems are presented and analyzed. These are compared to a similar randomized Lanczos algor...
Wayne Eberly, Erich Kaltofen