Sciweavers

1933 search results - page 130 / 387
» Improved Algorithms for the Feedback Vertex Set Problems
Sort
View
JCO
2010
67views more  JCO 2010»
15 years 2 months ago
Galaxy cutsets in graphs
Given a network G = (V, E), we say that a subset of vertices S ⊆ V has radius r if it is spanned by a tree of depth at most r. We are interested in determining whether G has a cu...
Nicolas Sonnerat, Adrian Vetta
SIAMDM
2008
79views more  SIAMDM 2008»
15 years 3 months ago
Reconfigurations in Graphs and Grids
Let G be a connected graph, and let V and V two n-element subsets of its vertex set V (G). Imagine that we place a chip at each element of V and we want to move them into the posi...
Gruia Calinescu, Adrian Dumitrescu, János P...
136
Voted
SETN
2010
Springer
15 years 10 months ago
Feature Selection for Improved Phone Duration Modeling of Greek Emotional Speech
In the present work we address the problem of phone duration modeling for the needs of emotional speech synthesis. Specifically, relying on ten well known machine learning techniqu...
Alexandros Lazaridis, Todor Ganchev, Iosif Mporas,...
MLMTA
2003
15 years 5 months ago
Improved Experimental Results Using Fuzzy Lattice Neurocomputing (FLN) Classifiers
— This work shows comparatively the capacity of five Fuzzy Lattice Neurocomputing (FLN) classifiers. The mechanics of the five classifiers are illustrated geometrically on the pl...
Al Cripps, Vassilis G. Kaburlasos, Nghiep Nguyen, ...
ICPR
2008
IEEE
16 years 5 months ago
Multiple kernel learning from sets of partially matching image features
Abstract: Kernel classifiers based on Support Vector Machines (SVM) have achieved state-ofthe-art results in several visual classification tasks, however, recent publications and d...
Guo ShengYang, Min Tan, Si-Yao Fu, Zeng-Guang Hou,...