Sciweavers

648 search results - page 71 / 130
» Simple Algorithms for a Weighted Interval Selection Problem
Sort
View
TSP
2010
13 years 2 months ago
Improving wireless physical layer security via cooperating relays
Physical (PHY) layer security approaches for wireless communications can prevent eavesdropping without upper layer data encryption. However, they are hampered by wireless channel c...
Lun Dong, Zhu Han, Athina P. Petropulu, H. Vincent...
DNA
2006
Springer
126views Bioinformatics» more  DNA 2006»
13 years 11 months ago
On the Complexity of Graph Self-assembly in Accretive Systems
We study the complexity of the Accretive Graph Assembly Problem (AGAP). An instance of AGAP consists of an edge-weighted graph G, a seed vertex in G, and a temperature . The goal i...
Stanislav Angelov, Sanjeev Khanna, Mirkó Vi...
STOC
2005
ACM
130views Algorithms» more  STOC 2005»
14 years 8 months ago
Low-distortion embeddings of general metrics into the line
A low-distortion embedding between two metric spaces is a mapping which preserves the distances between each pair of points, up to a small factor called distortion. Low-distortion...
Mihai Badoiu, Julia Chuzhoy, Piotr Indyk, Anastasi...
ICDE
2012
IEEE
228views Database» more  ICDE 2012»
11 years 10 months ago
A General Method for Estimating Correlated Aggregates over a Data Stream
—On a stream of two dimensional data items (x, y) where x is an item identifier, and y is a numerical attribute, a correlated aggregate query requires us to first apply a selec...
Srikanta Tirthapura, David P. Woodruff
ISAAC
2005
Springer
110views Algorithms» more  ISAAC 2005»
14 years 1 months ago
Minimum Entropy Coloring
Abstract We study an information-theoretic variant of the graph coloring problem in which the objective function to minimize is the entropy of the coloring. The minimum entropy of ...
Jean Cardinal, Samuel Fiorini, Gwenaël Joret