Sciweavers

2376 search results - page 321 / 476
» More Efficient Internal-Regret-Minimizing Algorithms
Sort
View
DAMON
2009
Springer
14 years 11 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
GECCO
2008
Springer
257views Optimization» more  GECCO 2008»
14 years 11 months ago
Rapid evaluation and evolution of neural models using graphics card hardware
This paper compares three common evolutionary algorithms and our modified GA, a Distributed Adaptive Genetic Algorithm (DAGA). The optimal approach is sought to adapt, in near rea...
Thomas F. Clayton, Leena N. Patel, Gareth Leng, Al...
ALMOB
2006
80views more  ALMOB 2006»
14 years 10 months ago
Effective p-value computations using Finite Markov Chain Imbedding (FMCI): application to local score and to pattern statistics
The technique of Finite Markov Chain Imbedding (FMCI) is a classical approach to complex combinatorial problems related to sequences. In order to get efficient algorithms, it is k...
Grégory Nuel
COMGEO
2004
ACM
14 years 10 months ago
A multi-dimensional approach to force-directed layouts of large graphs
We present a novel hierarchical force-directed method for drawing large graphs. Given a graph G = (V,E), the algorithm produces an embedding for G in an Euclidean space E of any d...
Pawel Gajer, Michael T. Goodrich, Stephen G. Kobou...
VISUALIZATION
1997
IEEE
15 years 2 months ago
An anti-aliasing technique for splatting
Splatting is a popular direct volume rendering algorithm. However, the algorithm does not correctly render cases where the volume sampling rate is higher than the image sampling r...
J. Edward Swan II, Klaus Mueller, Torsten Möl...