Sciweavers

413 search results - page 45 / 83
» Abstract Argumentation Scheme Frameworks
Sort
View
DAGM
2005
Springer
15 years 7 months ago
Regularization on Discrete Spaces
Abstract. We consider the classification problem on a finite set of objects. Some of them are labeled, and the task is to predict the labels of the remaining unlabeled ones. Such...
Dengyong Zhou, Bernhard Schölkopf
SODA
2012
ACM
253views Algorithms» more  SODA 2012»
13 years 4 months ago
Kernelization of packing problems
Kernelization algorithms are polynomial-time reductions from a problem to itself that guarantee their output to have a size not exceeding some bound. For example, d-Set Matching f...
Holger Dell, Dániel Marx
VMCAI
2012
Springer
13 years 9 months ago
Sound Non-statistical Clustering of Static Analysis Alarms
We present a sound method for clustering alarms from static analyzers. Our method clusters alarms by discovering sound dependencies between them such that if the dominant alarm of ...
Woosuk Lee, Wonchan Lee, Kwangkeun Yi
MLG
2007
Springer
15 years 8 months ago
A Universal Kernel for Learning Regular Languages
We give a universal kernel that renders all the regular languages linearly separable. We are not able to compute this kernel efficiently and conjecture that it is intractable, but...
Leonid Kontorovich
IDA
2009
Springer
15 years 8 months ago
Extension of Sparse, Adaptive Signal Decompositions to Semi-blind Audio Source Separation
Abstract. We apply sparse, fast and flexible adaptive lapped orthogonal transforms to underdetermined audio source separation using the time-frequency masking framework. This norm...
Andrew Nesbit, Emmanuel Vincent, Mark D. Plumbley