243 search results - page 42 / 49 » On Balanced Graphs |
KDD
2010
ACM
14 years 11 months ago
2010
ACM
Influence maximization, defined by Kempe, Kleinberg, and Tardos (2003), is the problem of finding a small set of seed nodes in a social network that maximizes the spread of influe...
DCOSS
2008
Springer
14 years 11 months ago
2008
Springer
Data-driven macroprogramming of wireless sensor networks (WSNs) provides an easy to use high-level task graph representation to the application developer. However, determining an e...
NIPS
2008
14 years 11 months ago
2008
Query expansion is a long-studied approach for improving retrieval effectiveness by enhancing the user's original query with additional related words. Current algorithms for ...
101
click to vote
ALENEX
2009
14 years 10 months ago
2009
Minimal perfect hash functions have been shown to be useful to compress data in several data management tasks. In particular, order-preserving minimal perfect hash functions [10] ...
EUROPAR
2010
Springer
14 years 10 months ago
2010
Springer
Abstract. We study the problem of dynamic load-balancing on hierarchical platforms. In particular, we consider applications involving heavy communications on a distributed platform...