219 search results - page 27 / 44 » Fast Algorithms for Finding Extremal Sets |
KDD
2005
ACM
14 years 8 months ago
2005
ACM
We propose a new algorithm for dimensionality reduction and unsupervised text classification. We use mixture models as underlying process of generating corpus and utilize a novel,...
TIP
2008
13 years 7 months ago
2008
In this paper, a novel method for reducing the runtime complexity of a support vector machine classifier is presented. The new training algorithm is fast and simple. This is achiev...
VLDB
2001
ACM
14 years 7 months ago
2001
ACM
Approximate query processing has emerged as a costeffective approach for dealing with the huge data volumes and stringent response-time requirements of today's decision-suppo...
JMLR
2010
13 years 2 months ago
2010
Current exact algorithms for score-based structure discovery in Bayesian networks on n nodes run in time and space within a polynomial factor of 2n . For practical use, the space ...
SRDS
1998
IEEE
13 years 12 months ago
1998
IEEE
A major cost in executing queries in a distributed database system is the data transfer cost incurred in transferring relations (fragments) accessed by a query from different site...