996 search results - page 82 / 200 » A general method to speed up fixed-parameter-tractable algor... |
296
click to vote
SDM
2011
SIAM
14 years 7 months ago
2011
SIAM
In this paper we present a fast and accurate procedure called clustered low rank matrix approximation for massive graphs. The procedure involves a fast clustering of the graph and...
124
click to vote
GECCO
2007
Springer
15 years 10 months ago
2007
Springer
The result of the program encoded into a Genetic Programming (GP) tree is usually returned by the root of that tree. However, this is not a general strategy. In this paper we pres...
153
click to vote
IDEAL
2004
Springer
15 years 10 months ago
2004
Springer
Proteins are known to perform a biological function by interacting with other proteins or compounds. Since protein–protein interaction is intrinsic to most cellular processes, pr...
186
click to vote
ICDM
2006
IEEE
15 years 10 months ago
2006
IEEE
How closely related are two nodes in a graph? How to compute this score quickly, on huge, disk-resident, real graphs? Random walk with restart (RWR) provides a good relevance scor...
127
click to vote
SDM
2008
SIAM
15 years 6 months ago
2008
SIAM
We define and solve the problem of "distribution classification", and, in general, "distribution mining". Given n distributions (i.e., clouds) of multi-dimensi...