Sciweavers

11740 search results - page 291 / 2348
» More Problems in Rewriting
Sort
View
STOC
2005
ACM
198views Algorithms» more  STOC 2005»
16 years 7 months ago
On lattices, learning with errors, random linear codes, and cryptography
Our main result is a reduction from worst-case lattice problems such as GAPSVP and SIVP to a certain learning problem. This learning problem is a natural extension of the `learnin...
Oded Regev
SODA
2010
ACM
215views Algorithms» more  SODA 2010»
16 years 4 months ago
Approximability of Robust Network Design
We consider robust network design problems where the set of feasible demands may be given by an arbitrary polytope or convex body more generally. This model, introduced by BenAmeu...
Neil Olver, F. Bruce Shepherd
MM
2005
ACM
145views Multimedia» more  MM 2005»
16 years 6 days ago
Multiple instance learning for labeling faces in broadcasting news video
Labeling faces in news video with their names is an interesting research problem which was previously solved using supervised methods that demand significant user efforts on lab...
Jun Yang 0003, Rong Yan, Alexander G. Hauptmann
WECWIS
2003
IEEE
120views ECommerce» more  WECWIS 2003»
15 years 12 months ago
Reinforcement Learning Applications in Dynamic Pricing of Retail Markets
In this paper, we investigate the use of reinforcement learning (RL) techniques to the problem of determining dynamic prices in an electronic retail market. As representative mode...
C. V. L. Raju, Y. Narahari, K. Ravikumar
ICCAD
1994
IEEE
134views Hardware» more  ICCAD 1994»
15 years 10 months ago
Boolean constrained encoding: a new formulation and a case study
1 This paper provides a new, generalized approach to the problem of encoding information as vectors of binary digits. We furnish a formal definition for the Boolean constrained enc...
Ney Laert Vilar Calazans