690 search results - page 45 / 138 » Dense Admissible Sets |
174
click to vote
CORR
2010
Springer
15 years 3 months ago
2010
Springer
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 ...
165
click to vote
RTSS
1999
IEEE
15 years 10 months ago
1999
IEEE
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...
348
click to vote
SIGMOD
2008
ACM
16 years 6 months ago
2008
ACM
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...
194
click to vote
CORR
2012
Springer
14 years 1 months ago
2012
Springer
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...
143
click to vote
CVPR
2008
IEEE
16 years 8 months ago
2008
IEEE
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. ...