Sciweavers

8669 search results - page 340 / 1734
» Computing matrix representations
Sort
View
RP
2010
Springer
118views Control Systems» more  RP 2010»
15 years 4 months ago
Efficient Construction of Semilinear Representations of Languages Accepted by Unary NFA
Chrobak (1986) proved that a language accepted by a given nondeterministic finite automaton with one-letter alphabet, i.e., a unary NFA, with n states can be represented as the uni...
Zdenek Sawa
CICLING
2009
Springer
16 years 7 months ago
Semantic Clustering for a Functional Text Classification Task
Abstract. We describe a semantic clustering method designed to address shortcomings in the common bag-of-words document representation for functional semantic classification tasks....
Thomas Lippincott, Rebecca J. Passonneau
DAGM
2006
Springer
15 years 10 months ago
Model Selection in Kernel Methods Based on a Spectral Analysis of Label Information
Abstract. We propose a novel method for addressing the model selection problem in the context of kernel methods. In contrast to existing methods which rely on hold-out testing or t...
Mikio L. Braun, Tilman Lange, Joachim M. Buhmann
DEXA
2006
Springer
80views Database» more  DEXA 2006»
15 years 10 months ago
Scalable Automated Service Composition Using a Compact Directory Digest
The composition of services that are indexed in a large-scale service directory often involves many complex queries issued by the service composition algorithm to the directory. Th...
Walter Binder, Ion Constantinescu, Boi Faltings
TSP
2008
124views more  TSP 2008»
15 years 6 months ago
Dictionary Preconditioning for Greedy Algorithms
This article introduces the concept of sensing dictionaries. It presents an alteration of greedy algorithms like thresholding or (Orthogonal) Matching Pursuit which improves their...
Karin Schnass, Pierre Vandergheynst