Sciweavers

1369 search results - page 166 / 274
» Lattice computations for random numbers
Sort
View
IJISEC
2006
108views more  IJISEC 2006»
13 years 9 months ago
How to obtain full privacy in auctions
Abstract Privacy has become a factor of increasing importance in auction design. We propose general techniques for cryptographic first-price and (M + 1)st-price auction protocols t...
Felix Brandt
IOR
2006
93views more  IOR 2006»
13 years 9 months ago
A Branch-and-Price Algorithm for the Multilevel Generalized Assignment Problem
The multilevel generalized assignment problem (MGAP) is a variation of the generalized assignment problem, in which agents can execute tasks at different efficiency levels with di...
Alberto Ceselli, Giovanni Righini
JIRS
2007
108views more  JIRS 2007»
13 years 9 months ago
GODZILA: A Low-resource Algorithm for Path Planning in Unknown Environments
— In this paper, we propose a novel path-planning and obstacle avoidance algorithm GODZILA for navigation in unknown environments. No prior knowledge of the environment is requir...
Prashanth Krishnamurthy, Farshad Khorrami
CORR
2000
Springer
134views Education» more  CORR 2000»
13 years 9 months ago
Learning Complexity Dimensions for a Continuous-Time Control System
This paper takes a computational learning theory approach to a problem of linear systems identification. It is assumed that inputs are generated randomly from a known class consist...
Pirkko Kuusela, Daniel Ocone, Eduardo D. Sontag
CORR
2010
Springer
94views Education» more  CORR 2010»
13 years 6 months ago
The Stability of Low-Rank Matrix Reconstruction: a Constrained Singular Value View
The stability of low-rank matrix reconstruction is investigated in this paper. The -constrained minimal singular value ( -CMSV) of the measurement operator is shown to determine t...
Gongguo Tang, Arye Nehorai