Sciweavers

440 search results - page 41 / 88
» Multiple Comparisons in Induction Algorithms
Sort
View
WSC
2007
15 years 4 months ago
Parallel cross-entropy optimization
The Cross-Entropy (CE) method is a modern and effective optimization method well suited to parallel implementations. There is a vast array of problems today, some of which are hig...
Gareth E. Evans, Jonathan M. Keith, Dirk P. Kroese
DAMON
2009
Springer
15 years 3 months ago
k-ary search on modern processors
This paper presents novel tree-based search algorithms that exploit the SIMD instructions found in virtually all modern processors. The algorithms are a natural extension of binar...
Benjamin Schlegel, Rainer Gemulla, Wolfgang Lehner
157
Voted
DATAMINE
1999
152views more  DATAMINE 1999»
15 years 2 months ago
Discovery of Frequent DATALOG Patterns
Discovery of frequent patterns has been studied in a variety of data mining settings. In its simplest form, known from association rule mining, the task is to discover all frequent...
Luc Dehaspe, Hannu Toivonen
WSC
2008
15 years 4 months ago
The improved sweep metaheuristic for simulation optimization and application to job shop scheduling
We present an improved sweep metaheuristic for discrete event simulation optimization. The sweep algorithm is a tree search similar to beam search. The basic idea is to run a limi...
George Jiri Mejtsky
CVPR
2004
IEEE
16 years 4 months ago
Cue Integration through Discriminative Accumulation
Object recognition systems aiming to work in real world settings should use multiple cues in order to achieve robustness. We present a new cue integration scheme which extends the...
Maria-Elena Nilsback, Barbara Caputo