3267 search results - page 174 / 654 » Generalized quasirandom graphs |
188
click to vote
EMSOFT
2011
Springer
14 years 6 months ago
2011
Springer
Most of the hard-real-time scheduling theory for multiprocessor systems assumes independent periodic or sporadic tasks. Such a simple task model is not directly applicable to mode...
184
click to vote
SIGMOD
2003
ACM
16 years 6 months ago
2003
ACM
To facilitate queries over semi-structured data, various structural summaries have been proposed. Structural summaries are derived directly from the data and serve as indices for ...
161
click to vote
SIGECOM
2006
ACM
16 years 15 days ago
2006
ACM
Braess’s Paradox is the counterintuitive but well-known fact that removing edges from a network with “selfish routing” can decrease the latency incurred by traffic in an eq...
174
click to vote
WEBI
2005
Springer
16 years 23 hour ago
2005
Springer
This work presents a new perspective on characterizing the similarity between elements of a database or, more generally, nodes of a weighted, undirected, graph. It is based on a M...
190
click to vote
PAMI
2006
15 years 6 months ago
2006
We provide evidence that non-linear dimensionality reduction, clustering and data set parameterization can be solved within one and the same framework. The main idea is to define ...