2137 search results - page 391 / 428 » Approximation Algorithms for Some Graph Partitioning Problem... |
117
click to vote
ICFP
2008
ACM
16 years 1 months ago
2008
ACM
Optimal path queries are queries to obtain an optimal path specified by a given criterion of optimality. There have been many studies to give efficient algorithms for classes of o...
131
click to vote
FSTTCS
2009
Springer
15 years 8 months ago
2009
Springer
A tournament T = (V, A) is a directed graph in which there is exactly one arc between every pair of distinct vertices. Given a digraph on n vertices and an integer parameter k, th...
110
click to vote
SDM
2009
SIAM
15 years 11 months ago
2009
SIAM
Recent research in frequent pattern mining (FPM) has shifted from obtaining the complete set of frequent patterns to generating only a representative (summary) subset of frequent ...
123
click to vote
SODA
2008
ACM
15 years 3 months ago
2008
ACM
A common approach for dealing with large data sets is to stream over the input in one pass, and perform computations using sublinear resources. For truly massive data sets, howeve...
106
click to vote
KDD
2010
ACM
15 years 11 days ago
2010
ACM
Malware categorization is an important problem in malware analysis and has attracted a lot of attention of computer security researchers and anti-malware industry recently. Todayâ...