Sciweavers

254 search results - page 27 / 51
» Binary amiable Words
Sort
View
DISOPT
2007
96views more  DISOPT 2007»
14 years 11 months ago
Symmetric ILP: Coloring and small integers
This paper presents techniques for handling symmetries in integer linear programs where variables can take integer values, extending previous work dealing exclusively with binary v...
François Margot
NIPS
2008
15 years 13 days ago
A Scalable Hierarchical Distributed Language Model
Neural probabilistic language models (NPLMs) have been shown to be competitive with and occasionally superior to the widely-used n-gram language models. The main drawback of NPLMs...
Andriy Mnih, Geoffrey E. Hinton
DAC
1996
ACM
15 years 3 months ago
Bit-Level Analysis of an SRT Divider Circuit
Abstract-- It is impractical to verify multiplier or divider circuits entirely at the bit-level using ordered Binary Decision Diagrams (BDDs), because the BDD representations for t...
Randal E. Bryant
APPROX
2006
Springer
100views Algorithms» more  APPROX 2006»
15 years 2 months ago
Robust Local Testability of Tensor Products of LDPC Codes
Given two binary linear codes R and C, their tensor product R C consists of all matrices with rows in R and columns in C. We analyze the "robustness" of the following te...
Irit Dinur, Madhu Sudan, Avi Wigderson
RSCTC
2000
Springer
143views Fuzzy Logic» more  RSCTC 2000»
15 years 2 months ago
On Efficient Construction of Decision Trees from Large Databases
The main task in decision tree construction algorithms is to find the "best partition" of the set of objects. In this paper, we investigate the problem of optimal binary ...
Hung Son Nguyen