198 search results - page 15 / 40 » A Sequential Algorithm for Generating Random Graphs |
AOSD
2007
ACM
15 years 1 months ago
2007
ACM
Inspired by our past manual aspect mining experiences, this paper describes a random walk model to approximate how crosscutting concerns can be discovered in the absence of domain...
76
Voted
AVI
2006
14 years 11 months ago
2006
This methodological note focuses on the edge density of real world examples of networks. The edge density is a parameter of interest typically when putting up user studies in an e...
94
Voted
BMCBI
2010
14 years 9 months ago
2010
Background: Assembling genomic sequences from a set of overlapping reads is one of the most fundamental problems in computational biology. Algorithms addressing the assembly probl...
100
click to vote
CODES
2010
IEEE
14 years 7 months ago
2010
IEEE
The last years have shown that there is no way to disregard the advantages provided by multiprocessor System-on-Chip (MPSoC) architectures in the embedded systems domain. Using mu...
ASIACRYPT
2009
Springer
15 years 4 months ago
2009
Springer
An r-collision for a function is a set of r distinct inputs with identical outputs. Actually finding r-collisions for a random map over a finite set of cardinality N requires at ...