Sciweavers

2283 search results - page 183 / 457
» Bounds of Graph Characteristics
Sort
View
HAIS
2010
Springer
14 years 1 months ago
Graph-Based Model-Selection Framework for Large Ensembles
The intuition behind ensembles is that different prediciton models compensate each other’s errors if one combines them in an appropriate way. In case of large ensembles a lot of...
Krisztian Buza, Alexandros Nanopoulos, Lars Schmid...
APVIS
2008
13 years 9 months ago
Visual Statistics for Collections of Clustered Graphs
We propose a method to visually summarize collections of networks on which a clustering of the vertices is given. Our method allows for efficient comparison of individual networks...
Ulrik Brandes, Jürgen Lerner, Miranda J. Lubb...
ECIR
2008
Springer
13 years 9 months ago
Use of Implicit Graph for Recommending Relevant Videos: A Simulated Evaluation
In this paper, we propose a model for exploiting community based usage information for video retrieval. Implicit usage information from a pool of past users could be a valuable sou...
David Vallet, Frank Hopfgartner, Joemon M. Jose
HPCA
2007
IEEE
14 years 2 months ago
Perturbation-based Fault Screening
Fault screeners are a new breed of fault identification technique that can probabilistically detect if a transient fault has affected the state of a processor. We demonstrate that...
Paul Racunas, Kypros Constantinides, Srilatha Mann...
WOSP
2004
ACM
14 years 1 months ago
Expressing performance requirements using regular expressions to specify stochastic probes over process algebra models
This paper describes how soft performance bounds can be expressed for software systems using stochastic probes over stochastic process algebra models. These stochastic probes are ...
Ashok Argent-Katwala, Jeremy T. Bradley, Nicholas ...