2925 search results - page 322 / 585 » Information Complexity of Online Problems |
188
Voted
SPIRE
2010
Springer
15 years 5 months ago
2010
Springer
We initiate the study of the smoothed complexity of the Closest String problem by proposing a semi-random model of Hamming distance. We restrict interest to the optimization versio...
184
click to vote
EDBTW
2010
Springer
15 years 5 months ago
2010
Springer
Spatial data warehouses (SDW) rely on extended multidimensional (MD) models in order to provide decision makers with appropriate structures to intuitively analyse spatial data. Se...
186
click to vote
CVPR
2005
IEEE
16 years 8 months ago
2005
IEEE
Hand-drawn diagrams present a complex recognition problem. Elements of the diagram are often individually ambiguous, and require context to be interpreted. We present a recognitio...
225
click to vote
ICIP
2000
IEEE
16 years 7 months ago
2000
IEEE
We present an algorithm that extracts the largest shape within a specificclass, starting from a set of image edgels. The algorithm inherits the Best-First Segmentation approach [jp...
187
click to vote
DCC
2005
IEEE
16 years 6 months ago
2005
IEEE
Minimum-entropy decoding is a universal decoding algorithm used in decoding block compression of discrete memoryless sources as well as block transmission of information across di...