1964 search results - page 95 / 393 » Partitioning Based Algorithms for Some Colouring Problems |
CORR
2010
Springer
13 years 2 months ago
2010
Springer
The diameter k-clustering problem is the problem of partitioning a finite subset of Rd into k subsets called clusters such that the maximum diameter of the clusters is minimized. ...
ICDE
2010
IEEE
14 years 5 months ago
2010
IEEE
— One of the central problems for data quality is inconsistency detection. Given a database D and a set Σ of dependencies as data quality rules, we want to identify tuples in D ...
DAGSTUHL
1996
13 years 9 months ago
1996
The areas of On-Line Algorithms and Machine Learning are both concerned with problems of making decisions about the present based only on knowledge of the past. Although these area...
COCOON
2007
Springer
14 years 2 months ago
2007
Springer
Given an RNA family characterized by conserved sequences and folding constraints, the problem is to search for all the instances of the RNA family in a genomic database. As seed-ba...
PCM
2005
Springer
14 years 1 months ago
2005
Springer
In this paper, a new multiple description image coding scheme using directional lifting transform is proposed. The basic idea is to divide an image into two descriptions with quinc...