Sciweavers

3991 search results - page 167 / 799
» Bounding homogeneous models
Sort
View
SODA
2003
ACM
114views Algorithms» more  SODA 2003»
13 years 9 months ago
Lower bounds for collusion-secure fingerprinting
Collusion-secure fingerprinting codes are an important primitive used by many digital watermarking schemes [1, 10, 9]. Boneh and Shaw [3] define a model for these types of codes...
Chris Peikert, Abhi Shelat, Adam Smith
SIGMOD
2008
ACM
138views Database» more  SIGMOD 2008»
14 years 8 months ago
Sampling time-based sliding windows in bounded space
Random sampling is an appealing approach to build synopses of large data streams because random samples can be used for a broad spectrum of analytical tasks. Users are often inter...
Rainer Gemulla, Wolfgang Lehner
PODC
2003
ACM
14 years 1 months ago
Performing work with asynchronous processors: message-delay-sensitive bounds
This paper considers the problem of performing tasks in asynchronous distributed settings. This problem, called DoAll, has been substantially studied in synchronous models, but th...
Dariusz R. Kowalski, Alexander A. Shvartsman
ICC
2008
IEEE
105views Communications» more  ICC 2008»
14 years 2 months ago
Scheduling and Pre-Conditioning in Multi-User MIMO TDD Systems
Abstract—The downlink transmission in multi-user multipleinput multiple-output (MIMO) systems has been extensively studied from both communication-theoretic and information-theor...
Jubin Jose, Alexei Ashikhmint, Phil Whiting, Srira...
IWQOS
2005
Springer
14 years 1 months ago
Designing a Predictable Internet Backbone with Valiant Load-Balancing
Abstract. Network operators would like their network to support current and future traffic matrices, even when links and routers fail. Not surprisingly, no backbone network can do ...
Rui Zhang-Shen, Nick McKeown