Sciweavers

154 search results - page 16 / 31
» Clos Solutions to Binary Methods
Sort
View
DCC
2005
IEEE
14 years 9 months ago
Efficient Alphabet Partitioning Algorithms for Low-Complexity Entropy Coding
We analyze the technique for reducing the complexity of entropy coding consisting in the a priori grouping of the source alphabet symbols, and in dividing the coding process in tw...
Amir Said
ACG
2006
Springer
14 years 3 months ago
Solving Probabilistic Combinatorial Games
Probabilistic combinatorial games (PCG) are a model for Go-like games recently introduced by Ken Chen. They differ from normal combinatorial games since terminal position in each ...
Ling Zhao, Martin Müller 0003
GECCO
2006
Springer
282views Optimization» more  GECCO 2006»
14 years 1 months ago
A genetic algorithm for the longest common subsequence problem
A genetic algorithm for the longest common subsequence problem encodes candidate sequences as binary strings that indicate subsequences of the shortest or first string. Its fitnes...
Brenda Hinkemeyer, Bryant A. Julstrom
ECCV
2002
Springer
14 years 11 months ago
Stereo Matching Using Belief Propagation
In this paper, we formulate the stereo matching problem as a Markov network consisting of three coupled Markov random fields (MRF's). These three MRF's model a smooth fie...
Jian Sun, Heung-Yeung Shum, Nanning Zheng
DAC
2002
ACM
14 years 10 months ago
A fast on-chip profiler memory
Profiling an application executing on a microprocessor is part of the solution to numerous software and hardware optimization and design automation problems. Most current profilin...
Roman L. Lysecky, Susan Cotterell, Frank Vahid