Sciweavers

597 search results - page 7 / 120
» Homomorphisms of random paths
Sort
View
FC
2003
Springer
101views Cryptology» more  FC 2003»
15 years 2 months ago
Fully Private Auctions in a Constant Number of Rounds
Abstract. We present a new cryptographic auction protocol that prevents extraction of bid information despite any collusion of participants. This requirement is stronger than commo...
Felix Brandt
TOC
2008
122views more  TOC 2008»
14 years 9 months ago
Derandomizing the Ahlswede-Winter matrix-valued Chernoff bound using pessimistic estimators, and applications
: Ahlswede and Winter [IEEE Trans. Inf. Th. 2002] introduced a Chernoff bound for matrix-valued random variables, which is a non-trivial generalization of the usual Chernoff bound ...
Avi Wigderson, David Xiao
APPROX
2000
Springer
153views Algorithms» more  APPROX 2000»
15 years 1 months ago
Randomized path coloring on binary trees
Motivated by the problem of WDM routing in all–optical networks, we study the following NP–hard problem. We are given a directed binary tree T and a set R of directed paths on ...
Vincenzo Auletta, Ioannis Caragiannis, Christos Ka...
ICIP
2008
IEEE
15 years 11 months ago
On the estimation of geodesic paths on sampled manifolds under random projections
In this paper, we focus on the use of random projections as a dimensionality reduction tool for sampled manifolds in highdimensional Euclidean spaces. We show that geodesic paths ...
Mona Mahmoudi, Pierre Vandergheynst, Matteo Sorci
WIOPT
2006
IEEE
15 years 3 months ago
A structural property of solutions to path optimization problems in random access networks
Abstract— The inherent nature of the physical setup and transmission mechanism in wireless ad hoc networks with random channel access, results in correlation between the link met...
Arzad Alam Kherani, Dinesh Kumar 0002, Eitan Altma...