Sciweavers

417 search results - page 48 / 84
» Running Time Predictions for Factoring Algorithms
Sort
View
SIGMETRICS
2005
ACM
150views Hardware» more  SIGMETRICS 2005»
15 years 3 months ago
An analytical model for multi-tier internet services and its applications
- Since many Web applications employ a multi-tier architecture, in this paper, we focus on the problem of analytically modeling the behavior of such applications. We present a mode...
Bhuvan Urgaonkar, Giovanni Pacifici, Prashant J. S...
KDD
2010
ACM
265views Data Mining» more  KDD 2010»
14 years 11 months ago
Scalable influence maximization for prevalent viral marketing in large-scale social networks
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...
Wei Chen, Chi Wang, Yajun Wang
FOCS
2008
IEEE
14 years 10 months ago
Matrix Sparsification for Rank and Determinant Computations via Nested Dissection
The nested dissection method developed by Lipton, Rose, and Tarjan is a seminal method for quickly performing Gaussian elimination of symmetric real positive definite matrices who...
Raphael Yuster
EUROPAR
2007
Springer
15 years 3 months ago
A First Step Towards Automatically Building Network Representations
To fully harness Grids, users or middlewares must have some knowledge on the topology of the platform interconnection network. As such knowledge is usually not available, one must ...
Lionel Eyraud-Dubois, Arnaud Legrand, Martin Quins...
IEEEPACT
2000
IEEE
15 years 2 months ago
A Lightweight Algorithm for Dynamic If-Conversion during Dynamic Optimization
Dynamic Optimization is an umbrella term that refers to any optimization of software that is performed after the initial compile time. It is a complementary optimization opportuni...
Kim M. Hazelwood, Thomas M. Conte