Sciweavers

3208 search results - page 359 / 642
» A Lower Bound for Primality
Sort
View
COMCOM
2004
110views more  COMCOM 2004»
15 years 6 months ago
On the latency and fairness characteristics of pre-order deficit round Robin
In the emerging high-speed packet-switched networks, fair packet scheduling algorithms in switches and routers will form an important component of the mechanisms that seek to sati...
Salil S. Kanhere, Harish Sethu
IH
2009
Springer
16 years 1 months ago
Estimating the Minimal Length of Tardos Code
Abstract. This paper estimates the minimal length of a binary probabilistic traitor tracing code. We consider the code construction proposed by G. Tardos in 2003, with the symmetri...
Teddy Furon, Luis Pérez-Freire, Arnaud Guya...
156
Voted
PKDD
2009
Springer
124views Data Mining» more  PKDD 2009»
16 years 1 months ago
Capacity Control for Partially Ordered Feature Sets
Abstract. Partially ordered feature sets appear naturally in many classification settings with structured input instances, for example, when the data instances are graphs and a fe...
Ulrich Rückert
ICC
2007
IEEE
142views Communications» more  ICC 2007»
16 years 1 months ago
Generalized CRLB for DA and NDA Synchronization of UWB Signals with Clock Offset
—In this paper the Cramér-Rao lower bound (CRLB) of an ultra-wideband (UWB) pulse amplitude modulated (PAM) signal with time hopping (TH) code is derived for the practical case ...
Saeed Khalesehosseini, John Nielsen
PPOPP
2006
ACM
16 years 20 days ago
Collective communication on architectures that support simultaneous communication over multiple links
Traditional collective communication algorithms are designed with the assumption that a node can communicate with only one other node at a time. On new parallel architectures such...
Ernie Chan, Robert A. van de Geijn, William Gropp,...