7015 search results - page 445 / 1403 » Approximation algorithms for co-clustering |
221
click to vote
ICCV
2011
IEEE
14 years 7 months ago
2011
IEEE
We describe a method for generating N-best configurations from part-based models, ensuring that they do not overlap according to some user-provided definition of overlap. We ext...
175
click to vote
DAM
2010
15 years 7 months ago
2010
Abstract. A set of phylogenetic trees with overlapping leaf sets is consistent if it can be merged without conflicts into a supertree. In this paper, we study the polynomial-time a...
182
click to vote
STOC
2009
ACM
16 years 7 months ago
2009
ACM
Consider the edge-connectivity survivable network design problem: given a graph G = (V, E) with edge-costs, and edgeconnectivity requirements rij Z0 for every pair of vertices i,...
248
click to vote
EDBT
2011
ACM
14 years 10 months ago
2011
ACM
Data integration systems offer users a uniform interface to a set of data sources. Previous work has typically assumed that the data sources are independent of each other; however...
192
click to vote
ICC
2011
IEEE
14 years 6 months ago
2011
IEEE
—In this paper, recent results in game theory and stochastic approximation are brought together to mitigate the problem of femto-to-macrocell cross-tier interference. The main re...