5595 search results - page 95 / 1119 » Approximation Algorithms for Clustering Problems |
141
click to vote
DKE
2006
15 years 4 months ago
2006
In recent years, the management and processing of so-called data streams has become a topic of active research in several fields of computer science such as, e.g., distributed sys...
178
click to vote
APCHI
2008
IEEE
15 years 11 months ago
2008
IEEE
Routing through a backbone, which is responsible for performing and managing multipoint communication, reduces the communication overhead and overall energy consumption in wireless...
143
click to vote
ATAL
2009
Springer
15 years 11 months ago
2009
Springer
Decentralized partially observable Markov decision processes (Dec-POMDPs) constitute a generic and expressive framework for multiagent planning under uncertainty. However, plannin...
187
click to vote
ISAAC
2005
Springer
15 years 10 months ago
2005
Springer
In this paper, we deal with both the complexity and the approximability of the labeled perfect matching problem in bipartite graphs. Given a simple graph G = (V, E) with n vertices...
161
click to vote
SADM
2008
15 years 4 months ago
2008
: Nonnegative matrix approximation (NNMA) is a popular matrix decomposition technique that has proven to be useful across a diverse variety of fields with applications ranging from...