Sciweavers

2492 search results - page 35 / 499
» On the General Signature Trees
Sort
View
IOR
2011
133views more  IOR 2011»
13 years 2 months ago
Finite Disjunctive Programming Characterizations for General Mixed-Integer Linear Programs
In this paper, we give a finite disjunctive programming procedure to obtain the convex hull of general mixed-integer linear programs (MILP) with bounded integer variables. We prop...
Binyuan Chen, Simge Küçükyavuz, S...
JMLR
2010
118views more  JMLR 2010»
13 years 2 months ago
Dirichlet Process Mixtures of Generalized Linear Models
We propose Dirichlet Process mixtures of Generalized Linear Models (DP-GLMs), a new method of nonparametric regression that accommodates continuous and categorical inputs, models ...
Lauren Hannah, David M. Blei, Warren B. Powell
CORR
2008
Springer
138views Education» more  CORR 2008»
13 years 7 months ago
Efficient Implementation of the Generalized Tunstall Code Generation Algorithm
A method is presented for constructing a Tunstall code that is linear time in the number of output items. This is an improvement on the state of the art for non-Bernoulli sources, ...
Michael B. Baer
MTPP
2010
13 years 5 months ago
A Fast General Parser for Automatic Code Generation
Abstract. The code generator in a compiler attempts to match a subject tree against a collection of tree-shaped patterns for generating instructions. Tree-pattern matching may be c...
Wuu Yang
TIT
2010
80views Education» more  TIT 2010»
13 years 2 months ago
Optical orthogonal signature pattern codes with maximum collision parameter 2 and weight 4
An optical orthogonal signature pattern code (OOSPC) finds application in transmitting 2-dimensional images through multicore fiber in code-division multiple-access (CDMA) communic...
Masanori Sawa