Sciweavers

790 search results - page 92 / 158
» Subexponential Parameterized Algorithms
Sort
View
ICPR
2010
IEEE
16 years 1 months ago
Semi-Supervised Distance Metric Learning by Quadratic Programming
This paper introduces a semi-supervised distance metric learning algorithm which uses pair-wise equivalence (similarity and dissimilarity) constraints to improve the original dist...
Hakan Cevikalp
190
Voted
ISAAC
2009
Springer
109views Algorithms» more  ISAAC 2009»
16 years 19 days ago
A Linear Vertex Kernel for Maximum Internal Spanning Tree
We present an algorithm that for any graph G and integer k ≥ 0 in time polynomial in the size of G either nds a spanning tree with at least k internal vertices, or outputs a ne...
Fedor V. Fomin, Serge Gaspers, Saket Saurabh, St&e...
ICASSP
2008
IEEE
16 years 16 days ago
Adaptive resolution-constrained scalar multiple-description coding
We consider adaptive two-channel multiple-description coding. We provide an analytical method for designing a resolutionconstrained symmetrical multiple-description coder that use...
Janusz Klejsa, Marcin Kuropatwinski, W. Bastiaan K...
SAS
2004
Springer
105views Formal Methods» more  SAS 2004»
15 years 11 months ago
Type Inference Against Races
Abstract. The race condition checker rccjava uses a formal type system to statically identify potential race conditions in concurrent Java programs, but it requires programmer-supp...
Cormac Flanagan, Stephen N. Freund
NIPS
2004
15 years 7 months ago
Blind One-microphone Speech Separation: A Spectral Learning Approach
We present an algorithm to perform blind, one-microphone speech separation. Our algorithm separates mixtures of speech without modeling individual speakers. Instead, we formulate ...
Francis R. Bach, Michael I. Jordan