Sciweavers

230 search results - page 28 / 46
» Experiments with Improved Approximate Mean Value Analysis Al...
Sort
View
KDD
2009
ACM
190views Data Mining» more  KDD 2009»
14 years 8 months ago
Efficient influence maximization in social networks
Influence maximization is the problem of finding a small subset of nodes (seed nodes) in a social network that could maximize the spread of influence. In this paper, we study the ...
Wei Chen, Yajun Wang, Siyu Yang
SIGIR
2012
ACM
11 years 10 months ago
An exploration of ranking heuristics in mobile local search
Users increasingly rely on their mobile devices to search local entities, typically businesses, while on the go. Even though recent work has recognized that the ranking signals in...
Yuanhua Lv, Dimitrios Lymberopoulos, Qiang Wu
NIPS
2003
13 years 9 months ago
AUC Optimization vs. Error Rate Minimization
The area under an ROC curve (AUC) is a criterion used in many applications to measure the quality of a classification algorithm. However, the objective function optimized in most...
Corinna Cortes, Mehryar Mohri
AIIA
2005
Springer
14 years 1 months ago
Towards Fault-Tolerant Formal Concept Analysis
Given Boolean data sets which record properties of objects, Formal Concept Analysis is a well-known approach for knowledge discovery. Recent application domains, e.g., for very lar...
Ruggero G. Pensa, Jean-François Boulicaut
SIGMETRICS
2008
ACM
161views Hardware» more  SIGMETRICS 2008»
13 years 7 months ago
Bound analysis of closed queueing networks with workload burstiness
Burstiness and temporal dependence in service processes are often found in multi-tier architectures and storage devices and must be captured accurately in capacity planning models...
Giuliano Casale, Ningfang Mi, Evgenia Smirni