Sciweavers

4539 search results - page 789 / 908
» Approaches to Compute Workflow Complexity
Sort
View
KAIS
2010
139views more  KAIS 2010»
15 years 2 months ago
Periodic subgraph mining in dynamic networks
In systems of interacting entities such as social networks, interactions that occur regularly typically correspond to significant, yet often infrequent and hard to detect, interact...
Mayank Lahiri, Tanya Y. Berger-Wolf
NOMS
2010
IEEE
251views Communications» more  NOMS 2010»
15 years 2 months ago
Online detection of utility cloud anomalies using metric distributions
—The online detection of anomalies is a vital element of operations in data centers and in utility clouds like Amazon EC2. Given ever-increasing data center sizes coupled with th...
Chengwei Wang, Vanish Talwar, Karsten Schwan, Part...
RSA
2010
89views more  RSA 2010»
15 years 2 months ago
Some remarks on Betti numbers of random polygon spaces
Polygon spaces like Mℓ = {(u1, · · · , un) ∈ S1 × · · · S1 ; n i=1 liui = 0}/SO(2) or they three dimensional analogues Nℓ play an important rle in geometry and topolo...
Clément Dombry, Christian Mazza
SAMOS
2010
Springer
15 years 2 months ago
Cycle-accurate performance modelling in an ultra-fast just-in-time dynamic binary translation instruction set simulator
—Instruction set simulators (ISS) are vital tools for compiler and processor architecture design space exploration and verification. State-of-the-art simulators using just-in-ti...
Igor Böhm, Björn Franke, Nigel P. Topham
SIAMSC
2010
104views more  SIAMSC 2010»
15 years 2 months ago
A New Sobolev Gradient Method for Direct Minimization of the Gross--Pitaevskii Energy with Rotation
Abstract. In this paper we improve traditional steepest descent methods for the direct minimization of the Gross-Pitaevskii (GP) energy with rotation at two levels. We first defi...
Ionut Danaila, Parimah Kazemi