500 search results - page 31 / 100 » Approximation algorithms for maximum independent set of pseu... |
121
click to vote
DAM
2010
15 years 1 months ago
2010
We introduce H -join decompositions of graphs, indexed by a fixed bipartite graph H . These decompositions are based on a graph operation that we call H -join, which adds edges be...
112
click to vote
SDM
2003
SIAM
15 years 3 months ago
2003
SIAM
We study the interaction between global and local techniques in data mining. Specifically, we study the collections of frequent sets in clusters produced by a probabilistic clust...
115
click to vote
PVLDB
2010
15 years 4 days ago
2010
Independence analysis is the problem of determining whether an update affects the result of a query, e.g. a constraint or materialized view. We develop a new, modular framework fo...
128
click to vote
ICC
2007
IEEE
15 years 8 months ago
2007
IEEE
—Multichannel communication in a Wireless Mesh Network with routers having multiple radio interfaces significantly enhances the network capacity. Efficient channel assignment an...
134
click to vote
MFCS
2009
Springer
15 years 6 months ago
2009
Springer
We present a simple algorithm for the maximum spanning star forest problem. We take advantage of the fact that the problem is a special case of complementary set cover and we adapt...