Sciweavers

3514 search results - page 600 / 703
» A search space
Sort
View
ESA
2009
Springer
149views Algorithms» more  ESA 2009»
14 years 4 months ago
Sparse Cut Projections in Graph Streams
Finding sparse cuts is an important tool for analyzing large graphs that arise in practice, such as the web graph, online social communities, and VLSI circuits. When dealing with s...
Atish Das Sarma, Sreenivas Gollapudi, Rina Panigra...
GECCO
2009
Springer
107views Optimization» more  GECCO 2009»
14 years 4 months ago
Swarming along the evolutionary branches sheds light on genome rearrangement scenarios
A genome rearrangement scenario describes a series of chromosome fusion, fission, and translocation operations that suffice to rewrite one genome into another. Exact algorithmic ...
Nikolay Vyahhi, Adrien Goëffon, Macha Nikolsk...
ISAAC
2009
Springer
132views Algorithms» more  ISAAC 2009»
14 years 4 months ago
Online Sorted Range Reporting
Abstract. We study the following one-dimensional range reporting problem: On an array A of n elements, support queries that given two indices i ≤ j and an integer k report the k ...
Gerth Stølting Brodal, Rolf Fagerberg, Mark...
SIGCOMM
2009
ACM
14 years 4 months ago
Opportunistic forwarding in workplaces
So far, the search for Opportunistic Network (ON) applications has focused on urban/rural scenarios where the combined use of mobility and the store-carry-and-forward paradigm hel...
Sabrina Gaito, Elena Pagani, Gian Paolo Rossi
CISS
2008
IEEE
14 years 4 months ago
A genetic algorithm for designing constellations with low error floors
—The error floor of bit-interleaved coded modulation with iterative decoding (BICM-ID) can be minimized for a particular constellation by maximizing the harmonic mean of the squ...
Matthew C. Valenti, Raghu Doppalapudi, Don J. Torr...