Sciweavers

851 search results - page 47 / 171
» Random constructions and density results
Sort
View
JSAC
2007
116views more  JSAC 2007»
14 years 10 months ago
Outreach: peer-to-peer topology construction towards minimized server bandwidth costs
Abstract— On-demand and live multimedia streaming applications (such as Internet TV) are well known to utilize a significant amount of bandwidth from media streaming servers, es...
Tara Small, Baochun Li, Ben Liang
FS
2006
105views more  FS 2006»
14 years 10 months ago
Financial equilibria in the semimartingale setting: Complete markets and markets with withdrawal constraints
We prove existence of stochastic financial equilibria on filtered spaces more general than the ones generated by finite-dimensional Brownian motions. These equilibria span complete...
Gordan Zitkovic
TMC
2008
125views more  TMC 2008»
14 years 10 months ago
Distributed Algorithm for Efficient Construction and Maintenance of Connected k-Hop Dominating Sets in Mobile Ad Hoc Networks
A k-hop dominating set is a subset of nodes such that each node not in the set can be reached within k hops from at least one node in the set. A connected k-hop dominating set can ...
Hong-Yen Yang, Chia-Hung Lin, Ming-Jer Tsai
COCO
2009
Springer
115views Algorithms» more  COCO 2009»
15 years 5 months ago
Locally Testable Codes Require Redundant Testers
Locally testable codes (LTCs) are error-correcting codes for which membership, in the code, of a given word can be tested by examining it in very few locations. Most known constru...
Eli Ben-Sasson, Venkatesan Guruswami, Tali Kaufman...
STACS
2005
Springer
15 years 4 months ago
Kolmogorov-Loveland Randomness and Stochasticity
An infinite binary sequence X is Kolmogorov-Loveland (or KL) random if there is no computable non-monotonic betting strategy that succeeds on X in the sense of having an unbounde...
Wolfgang Merkle, Joseph S. Miller, André Ni...