Sciweavers

389 search results - page 22 / 78
» Some natural decision problems in automatic graphs
Sort
View
EOR
2006
110views more  EOR 2006»
13 years 7 months ago
A constructive algorithm for realizing a distance matrix
The natural metric of a weighted graph is the length of the shortest paths between all pairs of vertices. The investigated problem consists in a representation of a given metric b...
Sacha C. Varone
CICLING
2010
Springer
13 years 2 months ago
An Empirical Study on the Feature's Type Effect on the Automatic Classification of Arabic Documents
The Arabic language is a highly flexional and morphologically very rich language. It presents serious challenges to the automatic classification of documents, one of which is deter...
Saeed Raheel, Joseph Dichy
KDD
2007
ACM
249views Data Mining» more  KDD 2007»
14 years 7 months ago
The minimum consistent subset cover problem and its applications in data mining
In this paper, we introduce and study the Minimum Consistent Subset Cover (MCSC) problem. Given a finite ground set X and a constraint t, find the minimum number of consistent sub...
Byron J. Gao, Martin Ester, Jin-yi Cai, Oliver Sch...
DAGM
2009
Springer
13 years 8 months ago
A Gradient Descent Approximation for Graph Cuts
Abstract. Graph cuts have become very popular in many areas of computer vision including segmentation, energy minimization, and 3D reconstruction. Their ability to find optimal res...
Alparslan Yildiz, Yusuf Sinan Akgul

Publication
207views
14 years 5 months ago
Incorporating Higher-Order Cues in Image Colorization
We consider the colorization problem of grayscale images when some pixels, called scribbles, with initial colors are given. In this paper, we propose a new multi-layer graph model ...
Tae Hoon Kim (Seoul National University), Kyoung M...