Sciweavers

851 search results - page 68 / 171
» Random constructions and density results
Sort
View
TIT
2002
63views more  TIT 2002»
14 years 10 months ago
Compressing quantum mixed-state sources by sending classical information
Abstract--We consider visible compression for discrete memoryless sources of mixed quantum states when only classical information can be sent from Alice to Bob. We assume that Bob ...
Emina Soljanin
GECCO
2009
Springer
103views Optimization» more  GECCO 2009»
14 years 8 months ago
Bumblebees: a multiagent combinatorial optimization algorithm inspired by social insect behaviour
This paper introduces a multiagent optimization algorithm inspired by the collective behavior of social insects. In our method, each agent encodes a possible solution of the probl...
Francesc Comellas, Jesus Martinez-Navarro
WIOPT
2011
IEEE
14 years 2 months ago
Lower bounds on the success probability for ad hoc networks with local FDMA scheduling
—This paper studies the performance of ad hoc networks with local FDMA scheduling using stochastic point processes. In such networks, the Poisson assumption is not justified due...
Ralph Tanbourgi, Jens P. Elsner, Holger Jäkel...
RSA
2011
106views more  RSA 2011»
14 years 1 months ago
Distances between pairs of vertices and vertical profile in conditioned Galton-Watson trees
We consider a conditioned Galton–Watson tree and prove an estimate of the number of pairs of vertices with a given distance, or, equivalently, the number of paths of a given leng...
Luc Devroye, Svante Janson
SDM
2009
SIAM
144views Data Mining» more  SDM 2009»
15 years 7 months ago
On Segment-Based Stream Modeling and Its Applications.
The primary constraint in the effective mining of data streams is the large volume of data which must be processed in real time. In many cases, it is desirable to store a summary...
Charu C. Aggarwal