3096 search results - page 36 / 620 » The Generalized FITC Approximation |
CORR
2010
Springer
13 years 7 months ago
2010
Springer
The Maximum Betweenness Centrality problem (MBC) can be defined as follows. Given a graph find a k-element node set C that maximizes the probability of detecting communication be...
KDD
2012
ACM
11 years 11 months ago
2012
ACM
Outlier mining in d-dimensional point sets is a fundamental and well studied data mining task due to its variety of applications. Most such applications arise in high-dimensional ...
CIKM
2010
Springer
13 years 7 months ago
2010
Springer
Pseudo-relevance feedback (PRF) improves search quality by expanding the query using terms from high-ranking documents from an initial retrieval. Although PRF can often result in ...
INFOCOM
2010
IEEE
13 years 7 months ago
2010
IEEE
—In this paper we consider the problem of maximizing wireless network capacity (a.k.a. one-shot scheduling) in both the protocol and physical models. We give the first distribut...
TALG
2010
13 years 7 months ago
2010
Fractional hypertree width is a hypergraph measure similar to tree width and hypertree width. Its algorithmic importance comes from the fact that, as shown in previous work [14], ...