Sciweavers

548 search results - page 71 / 110
» Using the Genetic Algorithm to Find Snake-in-the-Box Codes
Sort
View
TIT
2008
74views more  TIT 2008»
13 years 7 months ago
Optimal Parsing Trees for Run-Length Coding of Biased Data
Abstract-- We study coding schemes which encode unconstrained sequences into run-length-limited (d, k)-constrained sequences. We present a general framework for the construction of...
Sharon Aviran, Paul H. Siegel, Jack K. Wolf
EOR
2007
97views more  EOR 2007»
13 years 7 months ago
Using pattern matching for tiling and packing problems
act 12 This paper describes a new placement method based on pattern matching for 2D tiling problems. Tiling problem can be 13 considered as a special case of bin packing. In the pr...
Mahmood Amintoosi, Hadi Sadoghi Yazdi, Mahmood Fat...
BMCBI
2010
178views more  BMCBI 2010»
13 years 7 months ago
Selecting high-dimensional mixed graphical models using minimal AIC or BIC forests
Background: Chow and Liu showed that the maximum likelihood tree for multivariate discrete distributions may be found using a maximum weight spanning tree algorithm, for example K...
David Edwards, Gabriel C. G. de Abreu, Rodrigo Lab...
IEEEPACT
2008
IEEE
14 years 2 months ago
Feature selection and policy optimization for distributed instruction placement using reinforcement learning
Communication overheads are one of the fundamental challenges in a multiprocessor system. As the number of processors on a chip increases, communication overheads and the distribu...
Katherine E. Coons, Behnam Robatmili, Matthew E. T...
ICSAP
2010
13 years 9 months ago
Tamper Proofing 3D Models
- This paper describes a novel algorithm designed for tamper proofing of 3D models. Fragile watermarking is a known technique for detecting location of tamper in the artwork. Howev...
Mukesh C. Motwani, Balaji Sridharan, Rakhi C. Motw...