389 search results - page 2 / 78 » Some natural decision problems in automatic graphs |
ICANNGA
2007
Springer
13 years 8 months ago
2007
Springer
Abstract. The use of support vector machines for multi-category problems is still an open field to research. Most of the published works use the one-against-rest strategy, but with...
JGAA
2000
13 years 4 months ago
2000
This paper considers problems of the following type: given an edgeweighted k-colored input graph with maximum color class size c, find a minimum or maximum c-way cut such that eac...
SODA
2010
ACM
14 years 1 months ago
2010
ACM
Many NP-hard problems can be solved efficiently when the input is restricted to graphs of bounded tree-width or clique-width. In particular, by the celebrated result of Courcelle,...
CVPR
2005
IEEE
14 years 6 months ago
2005
IEEE
Interactive or semi-automatic segmentation is a useful alternative to pure automatic segmentation in many applications. While automatic segmentation can be very challenging, a sma...
NLDB
2007
Springer
13 years 10 months ago
2007
Springer
We intend on developing electronic dictionaries and Finite State Transducers for the automatic processing of the Albanian Language. We describe some peculiarities of this language ...