2698 search results - page 345 / 540 » Approximation Algorithms for the Weighted Independent Set Pr... |
185
click to vote
KDD
2008
ACM
16 years 7 months ago
2008
ACM
A hypergraph is a generalization of the traditional graph in which the edges are arbitrary non-empty subsets of the vertex set. It has been applied successfully to capture highord...
165
click to vote
STOC
1994
ACM
15 years 10 months ago
1994
ACM
Let G(3n, p, 3) be a random 3-colorable graph on a set of 3n vertices generated as follows. First, split the vertices arbitrarily into three equal color classes and then choose ev...
189
click to vote
ICPR
2010
IEEE
15 years 4 months ago
2010
IEEE
The expectation maximization (EM) algorithm is widely used in the Gaussian mixture model (GMM) as the state-of-art statistical modeling technique. Like the classical EM method, th...
186
click to vote
AI
2005
Springer
16 years 1 days ago
2005
Springer
In this research, a systematic study is conducted of four dimension reduction techniques for the text clustering problem, using five benchmark data sets. Of the four methods -- Ind...
194
click to vote
TIP
2008
15 years 6 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...