Sciweavers

8294 search results - page 151 / 1659
» Presenting Data from Experiments in Algorithmics
Sort
View
DATAMINE
1999
140views more  DATAMINE 1999»
15 years 4 months ago
A Scalable Parallel Algorithm for Self-Organizing Maps with Applications to Sparse Data Mining Problems
Abstract. We describe a scalable parallel implementation of the self organizing map (SOM) suitable for datamining applications involving clustering or segmentation against large da...
Richard D. Lawrence, George S. Almasi, Holly E. Ru...
131
Voted
GEOINFORMATICA
2006
116views more  GEOINFORMATICA 2006»
15 years 5 months ago
The Radial Topology Algorithm - A New Approach for Deriving 2.5D GIS Data Models
In this paper a new method for the combination of 2D GIS vector data and 2.5D DTM represented by triangulated irregular networks (TIN) to derive integrated triangular 2.5D object-b...
Ulrich Lenk, Christian Heipke
APPROX
2006
Springer
124views Algorithms» more  APPROX 2006»
15 years 8 months ago
Combinatorial Algorithms for Data Migration to Minimize Average Completion Time
The data migration problem is to compute an efficient plan for moving data stored on devices in a network from one configuration to another. It is modeled by a transfer graph, wher...
Rajiv Gandhi, Julián Mestre
138
Voted
SYNTHESE
2008
112views more  SYNTHESE 2008»
15 years 4 months ago
A sufficient condition for pooling data
We consider the problems arising from using sequences of experiments to discover the causal structure among a set of variables, none of whom are known ahead of time to be an "...
Frederick Eberhardt
144
Voted
ISCA
1998
IEEE
135views Hardware» more  ISCA 1998»
15 years 8 months ago
Branch Prediction Based on Universal Data Compression Algorithms
Data compression and prediction are closely related. Thus prediction methods based on data compression algorithms have been suggested for the branch prediction problem. In this wo...
Eitan Federovsky, Meir Feder, Shlomo Weiss