1964 search results - page 105 / 393 » Partitioning Based Algorithms for Some Colouring Problems |
CORR
2007
Springer
13 years 7 months ago
2007
Springer
We consider the problem of estimating the parameters of a Gaussian or binary distribution in such a way that the resulting undirected graphical model is sparse. Our approach is to...
ICASSP
2009
IEEE
14 years 2 months ago
2009
IEEE
Abstract—Hyperspectral unmixing aims at identifying the hidden spectral signatures (or endmembers) and their corresponding proportions (or abundances) from an observed hyperspect...
IICAI
2007
13 years 9 months ago
2007
In recent years statistical word alignment models have been widely used for various Natural Language Processing (NLP) problems. In this paper we describe a platform independent and...
GECCO
2003
Springer
14 years 1 months ago
2003
Springer
This paper presents an approach for classifying students in order to predict their final grade based on features extracted from logged data in an education web-based system. A comb...
STACS
2007
Springer
14 years 2 months ago
2007
Springer
The min-sum k-clustering problem is to partition a metric space (P, d) into k clusters C1, . . . , Ck ⊆ P such that k i=1 p,q∈Ci d(p, q) is minimized. We show the first effi...