Sciweavers

748 search results - page 110 / 150
» Time and Probability in Process Algebra
Sort
View
ICML
2008
IEEE
16 years 18 days ago
Fast incremental proximity search in large graphs
In this paper we investigate two aspects of ranking problems on large graphs. First, we augment the deterministic pruning algorithm in Sarkar and Moore (2007) with sampling techni...
Purnamrita Sarkar, Andrew W. Moore, Amit Prakash
IEEEARES
2009
IEEE
15 years 6 months ago
Estimating ToE Risk Level Using CVSS
—Security management is about calculated risk and requires continuous evaluation to ensure cost, time and resource effectiveness. Parts of which is to make future-oriented, costb...
Siv Hilde Houmb, Virginia N. L. Franqueira
SC
2009
ACM
15 years 6 months ago
Supporting fault-tolerance for time-critical events in distributed environments
In this paper, we consider the problem of supporting fault tolerance for adaptive and time-critical applications in heterogeneous and unreliable grid computing environments. Our g...
Qian Zhu, Gagan Agrawal
KDD
2009
ACM
169views Data Mining» more  KDD 2009»
15 years 6 months ago
On burstiness-aware search for document sequences
As the number and size of large timestamped collections (e.g. sequences of digitized newspapers, periodicals, blogs) increase, the problem of efficiently indexing and searching su...
Theodoros Lappas, Benjamin Arai, Manolis Platakis,...
ESA
2007
Springer
120views Algorithms» more  ESA 2007»
15 years 6 months ago
Evolutionary Equilibrium in Bayesian Routing Games: Specialization and Niche Formation
Abstract. In this paper we consider Nash Equilibria for the selfish routing model proposed in [12], where a set of n users with tasks of different size try to access m parallel l...
Petra Berenbrink, Oliver Schulte