Sciweavers

787 search results - page 156 / 158
» Polynomial Constants are Decidable
Sort
View
ECCC
2006
120views more  ECCC 2006»
13 years 7 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
JAIR
2008
171views more  JAIR 2008»
13 years 7 months ago
AND/OR Multi-Valued Decision Diagrams (AOMDDs) for Graphical Models
Inspired by AND/OR search spaces for graphical models recently introduced, we propose to augment Multi-Valued Decision Diagrams (MDD) with AND nodes, in order to capture function ...
Robert Mateescu, Rina Dechter, Radu Marinescu 0002
ML
2008
ACM
101views Machine Learning» more  ML 2008»
13 years 7 months ago
On reoptimizing multi-class classifiers
Significant changes in the instance distribution or associated cost function of a learning problem require one to reoptimize a previously-learned classifier to work under new cond...
Chris Bourke, Kun Deng, Stephen D. Scott, Robert E...
SIAMCOMP
2000
118views more  SIAMCOMP 2000»
13 years 6 months ago
Constructive, Deterministic Implementation of Shared Memory on Meshes
This paper describes a scheme to implement a shared address space of size m on an n-node mesh, with m polynomial in n, where each mesh node hosts a processor and a memory module. A...
Andrea Pietracaprina, Geppino Pucci, Jop F. Sibeyn
TNN
1998
254views more  TNN 1998»
13 years 6 months ago
Periodic symmetric functions, serial addition, and multiplication with neural networks
Abstract—This paper investigates threshold based neural networks for periodic symmetric Boolean functions and some related operations. It is shown that any n-input variable perio...
Sorin Cotofana, Stamatis Vassiliadis