Sciweavers

855 search results - page 144 / 171
» Complexity of Equations over Sets of Natural Numbers
Sort
View
ECCC
2006
120views more  ECCC 2006»
14 years 12 months ago
New Locally Decodable Codes and Private Information Retrieval Schemes
A q query Locally Decodable Code (LDC) encodes an n-bit message x as an N-bit codeword C(x), such that one can probabilistically recover any bit xi of the message by querying only...
Sergey Yekhanin
SIAMJO
2010
136views more  SIAMJO 2010»
14 years 6 months ago
A New Exchange Method for Convex Semi-Infinite Programming
In this paper we propose a new exchange method for solving convex semi-infinite programming (CSIP) problems. We introduce a new dropping-rule in the proposed exchange algorithm, wh...
Liping Zhang, Soon-Yi Wu, Marco A. López
ICDE
2010
IEEE
273views Database» more  ICDE 2010»
15 years 11 months ago
WikiAnalytics: Ad-hoc Querying of Highly Heterogeneous Structured Data
Searching and extracting meaningful information out of highly heterogeneous datasets is a hot topic that received a lot of attention. However, the existing solutions are based on e...
Andrey Balmin, Emiran Curtmola
UAI
2008
15 years 1 months ago
Dyna-Style Planning with Linear Function Approximation and Prioritized Sweeping
We consider the problem of efficiently learning optimal control policies and value functions over large state spaces in an online setting in which estimates must be available afte...
Richard S. Sutton, Csaba Szepesvári, Alborz...
BMCBI
2006
152views more  BMCBI 2006»
14 years 12 months ago
A two-stage approach for improved prediction of residue contact maps
Background: Protein topology representations such as residue contact maps are an important intermediate step towards ab initio prediction of protein structure. Although improvemen...
Alessandro Vullo, Ian Walsh, Gianluca Pollastri