Sciweavers

12264 search results - page 71 / 2453
» Analysis of the rubberband algorithm
Sort
View
PPL
2007
86views more  PPL 2007»
13 years 9 months ago
Failure-Sensitive Analysis of Parallel Algorithms with Controlled Memory Access Concurrency
ract problem of using P failure-prone processors to cooperatively update all locations of an N-element shared array is called Write-All. Solutions to Write-All can be used iterati...
Chryssis Georgiou, Alexander Russell, Alexander A....
ICML
1990
IEEE
14 years 1 months ago
Average Case Analysis of Conjunctive Learning Algorithms
We present an approach to modeling the average case behavior of learning algorithms. Our motivation is to predict the expected accuracy of learning algorithms as a function of the...
Michael J. Pazzani, Wendy Sarrett
IPPS
2009
IEEE
14 years 4 months ago
Compact graph representations and parallel connectivity algorithms for massive dynamic network analysis
Graph-theoretic abstractions are extensively used to analyze massive data sets. Temporal data streams from socioeconomic interactions, social networking web sites, communication t...
Kamesh Madduri, David A. Bader
PAKDD
2009
ACM
225views Data Mining» more  PAKDD 2009»
14 years 6 months ago
Change Analysis in Spatial Data by Combining Contouring Algorithms with Supervised Density Functions.
Detecting changes in spatial datasets is important for many fields. In this paper, we introduce a methodology for change analysis in spatial datasets that combines contouring algor...
Christoph F. Eick, Chun-Sheng Chen, Michael D. Twa...
ICALP
2003
Springer
14 years 2 months ago
Analysis of a Simple Evolutionary Algorithm for Minimization in Euclidean Spaces
Although evolutionary algorithms (EAs) are widely used in practical optimization, their theoretical analysis is still in its infancy. Up to now results on the (expected) runtime ar...
Jens Jägersküpper