Results 1  10
of
3,162
A Random Graph Model for Massive Graphs
 STOC 2000
, 2000
"... We propose a random graph model which is a special case of sparse random graphs with given degree sequences. This model involves only a small number of parameters, called logsize and loglog growth rate. These parameters capture some universal characteristics of massive graphs. Furthermore, from t ..."
Abstract

Cited by 406 (26 self)
 Add to MetaCart
We propose a random graph model which is a special case of sparse random graphs with given degree sequences. This model involves only a small number of parameters, called logsize and loglog growth rate. These parameters capture some universal characteristics of massive graphs. Furthermore, from
Data Streams: Algorithms and Applications
, 2005
"... In the data stream scenario, input arrives very rapidly and there is limited memory to store the input. Algorithms have to work with one or few passes over the data, space less than linear in the input size or time significantly less than the input size. In the past few years, a new theory has emerg ..."
Abstract

Cited by 533 (22 self)
 Add to MetaCart
In the data stream scenario, input arrives very rapidly and there is limited memory to store the input. Algorithms have to work with one or few passes over the data, space less than linear in the input size or time significantly less than the input size. In the past few years, a new theory has
Parallel Networks that Learn to Pronounce English Text
 COMPLEX SYSTEMS
, 1987
"... This paper describes NETtalk, a class of massivelyparallel network systems that learn to convert English text to speech. The memory representations for pronunciations are learned by practice and are shared among many processing units. The performance of NETtalk has some similarities with observed h ..."
Abstract

Cited by 549 (5 self)
 Add to MetaCart
This paper describes NETtalk, a class of massivelyparallel network systems that learn to convert English text to speech. The memory representations for pronunciations are learned by practice and are shared among many processing units. The performance of NETtalk has some similarities with observed
Reevaluating Amdahl’s law
 Commun. ACM
, 1988
"... At Sandia National Laboratories, we are currently engaged in research involving massively parallel processing. There is considerable skepticism regarding the viability of massive parallelism; the skepticism centers around Amdahl’s law, an argument put forth by Gene Amda.hl in 1967 [l] that even w ..."
Abstract

Cited by 316 (4 self)
 Add to MetaCart
At Sandia National Laboratories, we are currently engaged in research involving massively parallel processing. There is considerable skepticism regarding the viability of massive parallelism; the skepticism centers around Amdahl’s law, an argument put forth by Gene Amda.hl in 1967 [l] that even
The Evaluation for the Usefulness and Clinical Results of Arthroscopic Double Row Repair with UU Stitch for Massive Sized Full Thickness Rotator Cuff Tear
"... Purpose: The purpose of this study was to evaluate the usefulness and clinical results of arthroscopic double row repair with UU stitches for massive, fullthickness, rotator cuff tears. Materials and Methods: Between January 2007 and July 2009, we consulted on 36 massive tears in which it was possi ..."
Abstract
 Add to MetaCart
Purpose: The purpose of this study was to evaluate the usefulness and clinical results of arthroscopic double row repair with UU stitches for massive, fullthickness, rotator cuff tears. Materials and Methods: Between January 2007 and July 2009, we consulted on 36 massive tears in which
Massive Multimodality, Deception, and Genetic Algorithms
, 1992
"... This paper considers the use of genetic algorithms (GAs) for the solution of problems that are both averagesense misleading (deceptive) and massively multimodal. An archetypical multimodaldeceptive problem, here called a bipolar deceptive problem, is defined and two generalized constructions of su ..."
Abstract

Cited by 132 (24 self)
 Add to MetaCart
This paper considers the use of genetic algorithms (GAs) for the solution of problems that are both averagesense misleading (deceptive) and massively multimodal. An archetypical multimodaldeceptive problem, here called a bipolar deceptive problem, is defined and two generalized constructions
The Diameter of Random Massive Graphs
 Proceedings of the Twelfth ACMSIAM Symposium on Discrete Algorithms
, 2000
"... Many massive graphs (such as the WWW graph and Call graphs) share certain universal characteristics which can be described by socalled the "power law". Here we determine the diameter of random power law graphs up to a constant factor for almost all ranges of parameters. These results show ..."
Abstract

Cited by 36 (10 self)
 Add to MetaCart
show a strong evidence that the diameters of most massive graphs are about logarithm of their sizes up to a constant factor.
Massively multirobot simulation in stage
, 2008
"... Stage is a C++ software library that simulates multiple mobile robots. Stage version 2, as the simulation backend for the Player/Stage system, may be the most commonly used robot simulator in research and university teaching today. Development of Stage version 3 has focused on improving scalability ..."
Abstract

Cited by 52 (7 self)
 Add to MetaCart
scalability, usability, and portability. This paper examines Stage’s scalability. We propose a simple benchmark for multirobot simulator performance, and present results for Stage. Run time is shown to scale approximately linearly with population size up to 100,000 robots. For example, Stage simulates 1
Truss Decomposition in Massive Networks
"... The ktruss is a type of cohesive subgraphs proposed recently for the study of networks. While the problem of computing most cohesive subgraphs is NPhard, there exists a polynomial time algorithm for computing ktruss. Compared with kcore which is also efficient to compute, ktruss represents the ..."
Abstract

Cited by 25 (5 self)
 Add to MetaCart
truss in networks of moderate size. Then, we propose two I/Oefficient algorithms to handle massive networks that cannot fit in main memory. Our experiments on real datasets verify the efficiency of our algorithms and the value of ktruss. 1.
Adaptive incremental checkpointing for massively parallel systems
 In ICS ’04: Proceedings of the 18th annual international conference on Supercomputing
, 2004
"... Given the scale of massively parallel systems, occurrence of faults is no longer an exception but a regular event. Periodic checkpointing is becoming increasingly important in these systems. However, huge memory footprints of parallel applications place severe limitations on scalability of normal ch ..."
Abstract

Cited by 60 (4 self)
 Add to MetaCart
Given the scale of massively parallel systems, occurrence of faults is no longer an exception but a regular event. Periodic checkpointing is becoming increasingly important in these systems. However, huge memory footprints of parallel applications place severe limitations on scalability of normal
Results 1  10
of
3,162