Sciweavers

3991 search results - page 124 / 799
» Bounding homogeneous models
Sort
View
NCA
2005
IEEE
14 years 1 months ago
Fundamental Network Processor Performance Bounds
In this paper, fundamental conditions which bound the network processing unit (NPU) worst-case performance are established. In particular, these conditions formalize and integrate...
Hao Che, Chethan Kumar, Basavaraj Menasinahal
IWDW
2005
Springer
14 years 1 months ago
Performance Lower Bounds for Existing and New Uncoded Digital Watermarking Modulation Techniques
Abstract. Many coded digital watermarking systems development requires first the selection of a (uncoded) modulation technique to be part of a coded architecture. Therefore, perfo...
Marcos de Castro Pacitti, Weiler Alves Finamore
COCO
2001
Springer
161views Algorithms» more  COCO 2001»
14 years 17 days ago
Communication Complexity Lower Bounds by Polynomials
The quantum version of communication complexity allows the two communicating parties to exchange qubits and/or to make use of prior entanglement (shared EPRpairs). Some lower boun...
Harry Buhrman, Ronald de Wolf
COLT
2000
Springer
14 years 12 days ago
Computable Shell Decomposition Bounds
Haussler, Kearns, Seung and Tishby introduced the notion of a shell decomposition of the union bound as a means of understanding certain empirical phenomena in learning curves suc...
John Langford, David A. McAllester
4OR
2004
99views more  4OR 2004»
13 years 8 months ago
Upper bounds for revenue maximization in a satellite scheduling problem
This paper presents upper bounds for the Satellite Revenue Selection and Scheduling problem (SRSS). A compact model of this generalized Prize Collecting Traveling Salesman Problem ...
Thierry Benoist, Benoît Rottembourg