1220 search results - page 22 / 244 » Minimal Interval Completions |
KDD
2010
ACM
13 years 11 months ago
2010
ACM
Existing cost-sensitive learning methods work with unequal misclassification cost that is given by domain knowledge and appears as precise values. In many real-world applications,...
CSSC
2008
13 years 7 months ago
2008
The decorrelating property of the discrete wavelet transformation (DWT) appears valuable because one can avoid estimating the correlation structure in the original data space by b...
DM
1999
13 years 7 months ago
1999
A defining set (of vertex coloring) of a graph G is a set of vertices S with an assignment of colors to its elements which has a unique completion to a proper coloring of G. We de...
WG
2009
Springer
14 years 2 months ago
2009
Springer
In this paper, we study the sub-coloring and hypo-coloring problems on interval graphs. These problems have applications in job scheduling and distributed computing and can be used...
DASFAA
2005
IEEE
14 years 1 months ago
2005
IEEE
In many different application areas, e.g. space observation systems or engineering systems of world-wide operating companies, there is a need for an efficient distributed intersect...