728 search results - page 79 / 146 » Compressing combinatorial objects |
109
Voted
LPAR
2005
Springer
15 years 6 months ago
2005
Springer
Local search algorithms are one of the effective methods for solving hard combinatorial problems. However, a serious problem of this approach is that the search often traps at loca...
84
Voted
CASCON
2006
15 years 2 months ago
2006
This research studies the characteristics of field usage patterns in the SpecJVM98 benchmarks. It finds that multiple object instances of the same class often exhibit different fi...
193
Voted
ICIP
2010
IEEE
14 years 10 months ago
2010
IEEE
Detection of visually salient image regions is useful for applications like object segmentation, adaptive compression, and object recognition. Recently, full-resolution salient ma...
89
Voted
TIT
2011
14 years 7 months ago
2011
— This paper presents new lower and upper bounds for the compression rate of binary prefix codes optimized over memoryless sources according to various nonlinear codeword length...
103
Voted
CORR
2007
Springer
15 years 18 days ago
2007
Springer
There are several public key establishment protocols as well as complete public key cryptosystems based on allegedly hard problems from combinatorial (semi)group theory known by no...