16404 search results - page 756 / 3281 » A set coverage problem |
153
click to vote
ICPR
2008
IEEE
16 years 1 months ago
2008
IEEE
Support Vector Machines (SVMs), though accurate, are still difficult to solve large-scale applications, due to the computational and storage requirement. To relieve this problem,...
185
click to vote
CICLING
2005
Springer
16 years 1 months ago
2005
Springer
Abstract. With the current method of query formation, a Question Answering system retrieves a set of documents that are similar to a question, while what is mostly required is a se...
242
click to vote
ADBIS
2004
Springer
16 years 26 days ago
2004
Springer
In this paper we consider concurrent execution of multiple data mining queries in the context of discovery of frequent itemsets. If such data mining queries operate on similar part...
211
click to vote
ESA
2004
Springer
16 years 26 days ago
2004
Springer
Abstract. We propose a novel randomized algorithm for computing a dominating set based clustering in wireless ad-hoc and sensor networks. The algorithm works under a model which ca...
184
click to vote
INFOVIS
2000
IEEE
15 years 12 months ago
2000
IEEE
This paper introduces a number of general methods for visualizing commonality in sets of text files. Each visualization simultaneously compares one file in the set to all other ...