Sciweavers

182 search results - page 12 / 37
» Infinite Possibilities
Sort
View
TSP
2008
151views more  TSP 2008»
13 years 7 months ago
Reduce and Boost: Recovering Arbitrary Sets of Jointly Sparse Vectors
The rapid developing area of compressed sensing suggests that a sparse vector lying in a high dimensional space can be accurately and efficiently recovered from only a small set of...
Moshe Mishali, Yonina C. Eldar
VLDB
2007
ACM
104views Database» more  VLDB 2007»
14 years 7 months ago
Extending XQuery with Window Functions
This paper presents two extensions for XQuery. The first extension allows the definition and processing of different kinds of windows over an input sequence; i.e., tumbling, slidi...
Irina Botan, Peter M. Fischer, Daniela Florescu, D...
ICAART
2010
INSTICC
14 years 4 months ago
Complexity of Stochastic Branch and Bound Methods for Belief Tree Search in Bayesian Reinforcement Learning
There has been a lot of recent work on Bayesian methods for reinforcement learning exhibiting near-optimal online performance. The main obstacle facing such methods is that in most...
Christos Dimitrakakis
ACSD
2008
IEEE
106views Hardware» more  ACSD 2008»
13 years 9 months ago
Time-bounded model checking of infinite-state continuous-time Markov chains
The design of complex concurrent systems often involves intricate performance and dependability considerations. Continuous-time Markov chains (CTMCs) are widely used models for co...
Lijun Zhang, Holger Hermanns, Ernst Moritz Hahn, B...
EUROCRYPT
2000
Springer
13 years 11 months ago
Construction of Nonlinear Boolean Functions with Important Cryptographic Properties
Abstract. This paper addresses the problem of obtaining new construction methods for cryptographically significant Boolean functions. We show that for each positive integer m, ther...
Palash Sarkar, Subhamoy Maitra