Sciweavers

14 search results - page 2 / 3
» Width-Bounded Reducibility and Binary Search over Complexity...
Sort
View
DEXAW
1999
IEEE
109views Database» more  DEXAW 1999»
13 years 10 months ago
Detection of Polygonal Frames in Complex Document Images
A robust method for the localization of frames within document images is presented. It aims at detecting regions delimited by closed polygonal lines or edges in complex color, gra...
Stefano Messelodi, Carla Maria Modena
TWC
2008
209views more  TWC 2008»
13 years 5 months ago
Application of Nonbinary LDPC Cycle Codes to MIMO Channels
In this paper, we investigate the application of nonbinary low-density parity-check (LDPC) cycle codes over Galois field GF(q) to multiple-input multiple-output (MIMO) channels. Tw...
Ronghui Peng, Rong-Rong Chen
COLT
2008
Springer
13 years 7 months ago
An Efficient Reduction of Ranking to Classification
This paper describes an efficient reduction of the learning problem of ranking to binary classification. The reduction guarantees an average pairwise misranking regret of at most t...
Nir Ailon, Mehryar Mohri
CP
2000
Springer
13 years 10 months ago
Boosting Search with Variable Elimination
Abstract. Variable elimination is the basic step of Adaptive Consistency 4 . It transforms the problem into an equivalent one, having one less variable. Unfortunately, there are ma...
Javier Larrosa
CVPR
2007
IEEE
14 years 7 months ago
Kernel Sharing With Joint Boosting For Multi-Class Concept Detection
Object/scene detection by discriminative kernel-based classification has gained great interest due to its promising performance and flexibility. In this paper, unlike traditional ...
Wei Jiang, Shih-Fu Chang, Alexander C. Loui