1951 search results - page 224 / 391 » An algorithm for improving graph partitions |
161
click to vote
APPROX
2008
Springer
15 years 7 months ago
2008
Springer
We study approximation algorithms, integrality gaps, and hardness of approximation, of two problems related to cycles of "small" length k in a given graph. The instance f...
162
click to vote
SIGMOD
2010
ACM
15 years 9 months ago
2010
ACM
We consider the problem of computing all-pair correlations in a warehouse containing a large number (e.g., tens of thousands) of time-series (or, signals). The problem arises in a...
155
click to vote
COCOA
2009
Springer
15 years 8 months ago
2009
Springer
stract to be announcedPlenary session 09:00-10:00 Panos M, Pardalos, University of Florida, USA Tea Break 10:00-10:20 At the 1st floor 10:20-10:45 Polynomial Approximation Schemes ...
157
click to vote
MOBIHOC
2004
ACM
16 years 4 months ago
2004
ACM
We propose several novel localized algorithms to construct energy efficient routing structures for homogeneous wireless ad hoc networks, where all nodes have same maximum transmis...
156
click to vote
KDD
2007
ACM
16 years 5 months ago
2007
ACM
Correlation mining has gained great success in many application domains for its ability to capture the underlying dependency between objects. However, the research of correlation ...