Sciweavers

4110 search results - page 353 / 822
» Efficient algorithms for the 2-gathering problem
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
ECAI
2008
Springer
15 years 8 months ago
Incremental Diagnosis of DES by Satisfiability
Abstract. We propose a SAT-based algorithm for incremental diagnosis of discrete-event systems. The monotonicity is ensured by a prediction window that uses the future observations...
Alban Grastien, Anbulagan
ICML
2010
IEEE
15 years 7 months ago
Inverse Optimal Control with Linearly-Solvable MDPs
We present new algorithms for inverse optimal control (or inverse reinforcement learning, IRL) within the framework of linearlysolvable MDPs (LMDPs). Unlike most prior IRL algorit...
Dvijotham Krishnamurthy, Emanuel Todorov
ICDE
2003
IEEE
135views Database» more  ICDE 2003»
16 years 8 months ago
Discovery of High-Dimensional
Determining relationships such as functional or inclusion dependencies within and across databases is important for many applications in information integration. When such informa...
Andreas Koeller, Elke A. Rundensteiner
STOC
2010
ACM
269views Algorithms» more  STOC 2010»
15 years 10 months ago
Approximations for the Isoperimetric and Spectral Profile of Graphs and Related Parameters
The spectral profile of a graph is a natural generalization of the classical notion of its Rayleigh quotient. Roughly speaking, given a graph G, for each 0 < < 1, the spect...
Prasad Raghavendra, David Steurer and Prasad Tetal...