1578 search results - page 253 / 316 » Direct Routing: Algorithms and Complexity |
125
Voted
PKDD
2010
Springer
15 years 1 months ago
2010
Springer
Abstract. In this paper, we present an extensive study of the cuttingplane algorithm (CPA) applied to structural kernels for advanced text classification on large datasets. In par...
104
Voted
BMVC
2010
15 years 24 days ago
2010
In this paper, we propose a novel manifold alignment method by learning the underlying common manifold with supervision of corresponding data pairs from different observation sets...
121
Voted
TACAS
2010
Springer
15 years 19 days ago
2010
Springer
Software model checkers are being used mostly to discover specific types of errors in the code, since exhaustive verification of complex programs is not possible due to state explo...
105
Voted
ICASSP
2011
IEEE
14 years 6 months ago
2011
IEEE
This paper proposes a novel algorithm for decoding real-field codes over erroneous channels, where the encoded message is corrupted by sparse errors, i.e., impulsive noise. The m...
153
Voted
ICASSP
2011
IEEE
14 years 6 months ago
2011
IEEE
In the important domain of array shape calibration, the near-field case poses a challenging problem due to the array response complexity induced by the range effect. In this pape...