7015 search results - page 368 / 1403 » Approximation algorithms for co-clustering |
165
click to vote
WINE
2005
Springer
16 years 7 days ago
2005
Springer
We study the complexity issues for Walrasian equilibrium in a special case of combinatorial auction, called single-minded auction, in which every participant is interested in only ...
189
click to vote
DASFAA
2003
IEEE
16 years 2 days ago
2003
IEEE
Approximate string matching on large DNA sequences data is very important in bioinformatics. Some studies have shown that suffix tree is an efficient data structure for approxim...
228
click to vote
ESA
2003
Springer
15 years 12 months ago
2003
Springer
We prove that various geometric covering problems, related to the Travelling Salesman Problem cannot be efficiently approximated to within any constant factor unless P = NP. This ...
179
click to vote
SIGMOD
1998
ACM
15 years 11 months ago
1998
ACM
In large data recording and warehousing environments, it is often advantageous to provide fast, approximate answers to queries, whenever possible. Before DBMSs providing highly-ac...
192
click to vote
DOLAP
2005
ACM
15 years 8 months ago
2005
ACM
A novel framework for providing probabilistically-bounded approximate answers to non-holistic aggregate range queries in OLAP is presented in this paper. Such a framework allows u...