5595 search results - page 135 / 1119 » Approximation Algorithms for Clustering Problems |
119
click to vote
INFOCOM
2008
IEEE
15 years 11 months ago
2008
IEEE
—A fundamental problem in wireless networks is to estimate its throughput capacity - given a set of wireless nodes, and a set of connections, what is the maximum rate at which da...
150
click to vote
CORR
2007
Springer
15 years 4 months ago
2007
Springer
Motivated by applications in grid computing and projects management, we study multiprocessor scheduling in scenarios where there is uncertainty in the successful execution of jobs...
147
click to vote
COMPGEOM
2009
ACM
15 years 11 months ago
2009
ACM
Given a set system (X, R), the hitting set problem is to find a smallest-cardinality subset H ⊆ X, with the property that each range R ∈ R has a non-empty intersection with H...
132
click to vote
DIS
2009
Springer
15 years 11 months ago
2009
Springer
Abstract. Information networks, such as social networks and that extracted from bibliographic data, are changing dynamically over time. It is crucial to discover time-evolving comm...
146
Voted
ASC
2008
15 years 5 months ago
2008
: Discovering interesting patterns or substructures in data streams is an important challenge in data mining. Clustering algorithms are very often applied to identify single substr...