Sciweavers

2430 search results - page 146 / 486
» Computing Tutte Polynomials
Sort
View
TCC
2007
Springer
102views Cryptology» more  TCC 2007»
15 years 11 months ago
Parallel Repetition of Computationally Sound Protocols Revisited
Abstract. Parallel repetition is well known to reduce the error probability at an exponential rate for single- and multi-prover interactive proofs. Bellare, Impagliazzo and Naor (1...
Krzysztof Pietrzak, Douglas Wikström
TCOM
2008
81views more  TCOM 2008»
15 years 4 months ago
On optimal computation of MPLS label binding for multipoint-to-point connections
Most network operators have considered reducing Label Switched Routers (LSR) label spaces (i.e. the number of labels that can be used) as a means of simplifying management of under...
Fernando Solano, Ramón Fabregat, José...
INFOCOM
2009
IEEE
15 years 11 months ago
Computing the Capacity Region of a Wireless Network
—We consider a wireless network of n nodes that communicate over a common wireless medium under some interference constraints. Our work is motivated by the need for an efficient...
Ramakrishna Gummadi, Kyomin Jung, Devavrat Shah, R...
ICPR
2004
IEEE
16 years 6 months ago
Training of Classifiers Using Virtual Samples Only
This paper describes the training of classifiers entirely based on virtual images, rendered by a ray-tracing software. Two classifiers, a support vector machine and a polynomial c...
Annika Kuhl, Lars Krüger, Christian Wöhl...
DCC
2005
IEEE
16 years 4 months ago
Real, Tight Frames with Maximal Robustness to Erasures
Motivated by the use of frames for robust transmission over the Internet, we present a first systematic construction of real tight frames with maximum robustness to erasures. We a...
Jelena Kovacevic, Markus Püschel