Sciweavers

690 search results - page 45 / 138
» Dense Admissible Sets
Sort
View
CORR
2010
Springer
163views Education» more  CORR 2010»
14 years 9 months ago
Design of QoS-aware Provisioning Systems
We present an architecture of a hosting system consisting of a set of hosted Web Services subject to QoS constraints, and a certain number of servers used to run users demand. The ...
Michele Mazzucco, Manuel Mazzara, Nicola Dragoni
RTSS
1999
IEEE
15 years 4 months ago
Design and Implementation of Statistical Rate Monotonic Scheduling in KURT Linux
Statistical Rate Monotonic Scheduling (SRMS) is a generalization of the classical RMS results of Liu and Layland [LL73] for periodic tasks with highly variable execution times and...
Alia Atlas, Azer Bestavros
SIGMOD
2008
ACM
215views Database» more  SIGMOD 2008»
15 years 12 months ago
CSV: visualizing and mining cohesive subgraphs
Extracting dense sub-components from graphs efficiently is an important objective in a wide range of application domains ranging from social network analysis to biological network...
Nan Wang, Srinivasan Parthasarathy, Kian-Lee Tan, ...
CORR
2012
Springer
228views Education» more  CORR 2012»
13 years 7 months ago
Faster Approximate Distance Queries and Compact Routing in Sparse Graphs
A distance oracle is a compact representation of the shortest distance matrix of a graph. It can be queried to retrieve approximate distances and corresponding paths between any p...
Rachit Agarwal, Brighten Godfrey, Sariel Har-Peled
CVPR
2008
IEEE
16 years 1 months ago
Increasing the density of Active Appearance Models
Active Appearance Models (AAMs) typically only use 50-100 mesh vertices because they are usually constructed from a set of training images with the vertices hand-labeled on them. ...
Krishnan Ramnath, Simon Baker, Iain Matthews, Deva...