200 search results - page 14 / 40 » A combinatorial approach to the power of 2 in the number of ... |
TIT
2010
13 years 3 months ago
2010
We directly lower bound the information capacity for channels with i.i.d. deletions and duplications. Our approach differs from previous work in that we focus on the information ca...
STACS
1992
Springer
14 years 26 days ago
1992
Springer
We show how to speed up two string-matching algorithms: the Boyer-Moore algorithm (BM algorithm), and its version called here the reverse factor algorithm (RF algorithm). The RF al...
MICCAI
2007
Springer
14 years 9 months ago
2007
Springer
Non-rigid image registration is an ill-posed yet challenging problem due to its supernormal high degree of freedoms and inherent requirement of smoothness. Graph-cuts method is a p...
TCS
2011
13 years 3 months ago
2011
It is a well-know fact that apparently simple systems can give rise to complex behavior. But why exactly does a given system behave in a complex manner? There are two main approac...
JAIR
2007
13 years 8 months ago
2007
Many combinatorial optimization problems such as the bin packing and multiple knapsack problems involve assigning a set of discrete objects to multiple containers. These problems ...