Sciweavers

2745 search results - page 240 / 549
» A fast algorithm for computing large Fibonacci numbers
Sort
View
KDD
2003
ACM
217views Data Mining» more  KDD 2003»
16 years 5 months ago
Algorithms for estimating relative importance in networks
Large and complex graphs representing relationships among sets of entities are an increasingly common focus of interest in data analysis--examples include social networks, Web gra...
Scott White, Padhraic Smyth
ISPASS
2008
IEEE
15 years 11 months ago
Independent Component Analysis and Evolutionary Algorithms for Building Representative Benchmark Subsets
— This work addresses the problem of building representative subsets of benchmarks from an original large set of benchmarks, using statistical analysis techniques. The subsets sh...
Vassilios N. Christopoulos, David J. Lilja, Paul R...
ICPR
2002
IEEE
15 years 9 months ago
Generalized Pattern Spectra Sensitive to Spatial Information
Morphological pattern spectra computed from granulometries are frequently used to classify the size classes of details in textures and images. An extension of this technique, whic...
Michael H. F. Wilkinson
IPPS
1999
IEEE
15 years 8 months ago
Reducing I/O Complexity by Simulating Coarse Grained Parallel Algorithms
Block-wise access to data is a central theme in the design of efficient external memory (EM) algorithms. A second important issue, when more than one disk is present, is fully par...
Frank K. H. A. Dehne, David A. Hutchinson, Anil Ma...
STOC
1997
ACM
125views Algorithms» more  STOC 1997»
15 years 8 months ago
An Interruptible Algorithm for Perfect Sampling via Markov Chains
For a large class of examples arising in statistical physics known as attractive spin systems (e.g., the Ising model), one seeks to sample from a probability distribution π on an...
James Allen Fill