500 search results - page 31 / 100 » Approximation algorithms for maximum independent set of pseu... |
172
click to vote
DAM
2010
15 years 6 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...
162
Voted
SDM
2003
SIAM
15 years 7 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...
163
click to vote
PVLDB
2010
15 years 4 months 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...
177
click to vote
ICC
2007
IEEE
16 years 12 days 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...
195
click to vote
MFCS
2009
Springer
15 years 10 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...