Sciweavers

11562 search results - page 2086 / 2313
» Parallel Imaging Problem
Sort
View
ICALP
1992
Springer
15 years 10 months ago
Near-perfect Token Distribution
Suppose that n tokens are arbitrarily placed on the n nodes of a graph. At each parallel step one token may be moved from each node to an adjacent node. An algorithm for the near-...
Andrei Z. Broder, Alan M. Frieze, Eli Shamir, Eli ...
ISCAPDCS
2004
15 years 7 months ago
Randomized Sorting on the POPS Network
Partitioned Optical Passive Stars (POPS) network has been presented recently as a desirable model of parallel computation. Several papers have been published that address fundamen...
Jaime Davila, Sanguthevar Rajasekaran
ECCV
2010
Springer
15 years 6 months ago
MIForests: Multiple-Instance Learning with Randomized Trees
Abstract. Multiple-instance learning (MIL) allows for training classifiers from ambiguously labeled data. In computer vision, this learning paradigm has been recently used in many ...
Christian Leistner, Amir Saffari, Horst Bischof
BMCBI
2008
160views more  BMCBI 2008»
15 years 6 months ago
Feature selection environment for genomic applications
Background: Feature selection is a pattern recognition approach to choose important variables according to some criteria in order to distinguish or explain certain phenomena (i.e....
Fabrício Martins Lopes, David Correa Martin...
GPEM
2008
98views more  GPEM 2008»
15 years 6 months ago
Sporadic model building for efficiency enhancement of the hierarchical BOA
Efficiency enhancement techniques--such as parallelization and hybridization--are among the most important ingredients of practical applications of genetic and evolutionary algori...
Martin Pelikan, Kumara Sastry, David E. Goldberg
« Prev « First page 2086 / 2313 Last » Next »