Sciweavers

1968 search results - page 387 / 394
» The Complexity of Valued Constraint Models
Sort
View
CVPR
2011
IEEE
13 years 2 months ago
Accelerated Low-Rank Visual Recovery by Random Projection
Exact recovery from contaminated visual data plays an important role in various tasks. By assuming the observed data matrix as the addition of a low-rank matrix and a sparse matri...
Yadong Mu, Jian Dong, Xiaotong Yuan, Shuicheng Yan
JMLR
2010
148views more  JMLR 2010»
13 years 2 months ago
A Generalized Path Integral Control Approach to Reinforcement Learning
With the goal to generate more scalable algorithms with higher efficiency and fewer open parameters, reinforcement learning (RL) has recently moved towards combining classical tec...
Evangelos Theodorou, Jonas Buchli, Stefan Schaal
FOSSACS
2011
Springer
12 years 10 months ago
Minimizing Deterministic Lattice Automata
Traditional automata accept or reject their input, and are therefore Boolean. In contrast, weighted automata map each word to a value from a semiring over a large domain. The speci...
Shulamit Halamish, Orna Kupferman
INFOCOM
2011
IEEE
12 years 10 months ago
Adaptive wireless channel probing for shared key generation
—Generating a shared key between two parties from the wireless channel is of increasing interest. The procedure for obtaining information from wireless channel is called channel ...
Yunchuan Wei, Kai Zeng, Prasant Mohapatra
SIGMOD
2012
ACM
212views Database» more  SIGMOD 2012»
11 years 9 months ago
Local structure and determinism in probabilistic databases
While extensive work has been done on evaluating queries over tuple-independent probabilistic databases, query evaluation over correlated data has received much less attention eve...
Theodoros Rekatsinas, Amol Deshpande, Lise Getoor