32545 search results - page 353 / 6509 » Data Structures and Algorithms |
165
click to vote
SODA
1996
ACM
15 years 8 months ago
1996
ACM
We describe several RNC algorithms for generating graphs and subgraphs uniformly at random. For example, unlabelled undirected graphs are generated in O(lg3 n) time using O n2 lg3...
153
click to vote
FOCS
2006
IEEE
16 years 26 days ago
2006
IEEE
We present new algebraic approaches for several wellknown combinatorial problems, including non-bipartite matching, matroid intersection, and some of their generalizations. Our wo...
138
Voted
SIAMMAX
2010
15 years 1 months ago
2010
Computational resolution enhancement (superresolution) is generally regarded as a memory intensive process due to the large matrix-vector calculations involved. In this paper, a de...
192
Voted
GECCO
2006
Springer
15 years 10 months ago
2006
Springer
The application of network analysis to emergent mating topologies in spatially structured genetic algorithms is presented in this preliminary study as a framework for inferring ev...