Sciweavers

1089 search results - page 61 / 218
» Bounds on generalized Frobenius numbers
Sort
View
CRYPTO
2010
Springer
181views Cryptology» more  CRYPTO 2010»
15 years 8 months ago
On the Efficiency of Classical and Quantum Oblivious Transfer Reductions
Due to its universality oblivious transfer (OT) is a primitive of great importance in secure multi-party computation. OT is impossible to implement from scratch in an unconditional...
Severin Winkler, Jürg Wullschleger
ALT
2006
Springer
16 years 3 months ago
How Many Query Superpositions Are Needed to Learn?
Abstract. This paper introduces a framework for quantum exact learning via queries, the so-called quantum protocol. It is shown that usual protocols in the classical learning setti...
Jorge Castro
DIALM
2003
ACM
175views Algorithms» more  DIALM 2003»
16 years 1 days ago
Localized construction of bounded degree and planar spanner for wireless ad hoc networks
We propose a novel localized algorithm that constructs a bounded degree and planar spanner for wireless ad hoc networks modeled by unit disk graph (UDG). Every node only has to kn...
Yu Wang 0003, Xiang-Yang Li
COR
2007
183views more  COR 2007»
15 years 6 months ago
Arcs-states models for the vehicle routing problem with time windows and related problems
This paper presents several Arcs-States models that can be applied to numerous vehicle routing problems, one of which is the well-known vehicle routing problem with capacities and...
Thierry Mautor, Edith Naudin
CORR
2011
Springer
202views Education» more  CORR 2011»
15 years 1 months ago
Online Least Squares Estimation with Self-Normalized Processes: An Application to Bandit Problems
The analysis of online least squares estimation is at the heart of many stochastic sequential decision-making problems. We employ tools from the self-normalized processes to provi...
Yasin Abbasi-Yadkori, Dávid Pál, Csa...