Sciweavers

560 search results - page 52 / 112
» Multiplication by a Constant is Sublinear
Sort
View
ICC
2007
IEEE
132views Communications» more  ICC 2007»
15 years 1 months ago
Supporting Bulk Data Transfers of High-End Applications with Guaranteed Completion Time
In high-end grid networks, distributed resources (scientific instruments, CPUs, storages, etc.) are interconnected to support computing-intensive and data-intensive applications, w...
Bin Bin Chen, Pascale Vicat-Blanc Primet
FOCS
2004
IEEE
15 years 1 months ago
An Approximate Max-Steiner-Tree-Packing Min-Steiner-Cut Theorem
Given an undirected multigraph G and a subset of vertices S V (G), the STEINER TREE PACKING problem is to find a largest collection of edge-disjoint trees that each connects S. T...
Lap Chi Lau
FOCS
1995
IEEE
15 years 1 months ago
Tracking the Best Disjunction
Abstract. Littlestone developed a simple deterministic on-line learning algorithm for learning k-literal disjunctions. This algorithm (called Winnow) keeps one weight for each of t...
Peter Auer, Manfred K. Warmuth
NETWORKING
2007
14 years 11 months ago
Simple Models for the Performance Evaluation of a Class of Two-Hop Relay Protocols
We evaluate the performance of a class of two-hop relay protocols for mobile ad hoc networks. The interest is on the multicopy two-hop relay (MTR) protocol, where the source may ge...
Ahmad Al Hanbali, Arzad Alam Kherani, Philippe Nai...
CIIT
2004
14 years 11 months ago
Considerations on the bit error probability of optical CDMA systems
( )1 The most common metric for evaluating the performance of an optical communications system is the symbol error probability (SEP) versus the received optical power. In circuit-l...
Stefano Galli, Ronald Menendez, Russel Fischer, Ro...