3019 search results - page 137 / 604 » Approximating the Domatic Number |
176
click to vote
STACS
2007
Springer
16 years 11 days ago
2007
Springer
We consider the problem of computing an approximate minimum cycle basis of an undirected non-negative edge-weighted graph G with m edges and n vertices; the extension to directed ...
158
click to vote
TAMC
2007
Springer
16 years 11 days ago
2007
Springer
We study non-overlapping axis-parallel packings of 3D boxes with profits into a dedicated bigger box where rotation is either forbidden or permitted; we wish to maximize the total...
178
click to vote
SSDBM
2003
IEEE
15 years 11 months ago
2003
IEEE
String data is ubiquitous, and its management has taken on particular importance in the past few years. Approximate queries are very important on string data especially for more c...
185
click to vote
ICML
2004
IEEE
16 years 7 months ago
2004
IEEE
The problem of computing low rank approximations of matrices is considered. The novel aspect of our approach is that the low rank approximations are on a collection of matrices. W...
149
click to vote
WWW
2007
ACM
16 years 7 months ago
2007
ACM
Discovering mappings between concept hierarchies is widely regarded as one of the hardest and most urgent problems facing the Semantic Web. The problem is even harder in domains w...