Sciweavers

7522 search results - page 1131 / 1505
» Spacing memetic algorithms
Sort
View
CORR
2007
Springer
47views Education» more  CORR 2007»
15 years 4 months ago
Data Structures for Mergeable Trees
Motivated by an application in computational topology, we consider a novel variant of the problem of efficiently maintaining dynamic rooted trees. This variant allows an operation...
Loukas Georgiadis, Haim Kaplan, Nira Shafrir, Robe...
ISI
2006
Springer
15 years 4 months ago
Collective Sampling and Analysis of High Order Tensors for Chatroom Communications
This work investigates the accuracy and efficiency tradeoffs between centralized and collective (distributed) algorithms for (i) sampling, and (ii) n-way data analysis techniques i...
Evrim Acar, Seyit Ahmet Çamtepe, Bülen...
CSDA
2007
105views more  CSDA 2007»
15 years 4 months ago
Calculation of simplicial depth estimators for polynomial regression with applications
A fast algorithm for calculating the simplicial depth of a single parameter vector of a polynomial regression model is derived. Additionally, an algorithm for calculating the para...
R. Wellmann, S. Katina, Ch. H. Müller
JDWM
2006
104views more  JDWM 2006»
15 years 4 months ago
Navigation Rules for Exploring Large Multidimensional Data Cubes
Navigating through multidimensional data cubes is a nontrivial task. Although On-Line Analytical Processing (OLAP) provides the capability to view multidimensional data through ro...
Navin Kumar, Aryya Gangopadhyay, George Karabatis,...
JEA
2006
83views more  JEA 2006»
15 years 4 months ago
Cache-Friendly implementations of transitive closure
In this paper we show cache-friendly implementations of the Floyd-Warshall algorithm for the All-Pairs ShortestPath problem. We first compare the best commercial compiler optimiza...
Michael Penner, Viktor K. Prasanna
« Prev « First page 1131 / 1505 Last » Next »