777 search results - page 98 / 156 » A fast algorithm for the computation of an upper bound on th... |
STOC
2006
ACM
14 years 9 months ago
2006
ACM
We study rerouting policies in a dynamic round-based variant of a well known game theoretic traffic model due to Wardrop. Previous analyses (mostly in the context of selfish routi...
JCP
2008
13 years 8 months ago
2008
Existing frequent subgraph mining algorithms can operate efficiently on graphs that are sparse, have vertices with low and bounded degrees, and contain welllabeled vertices and edg...
CVPR
2009
IEEE
15 years 3 months ago
2009
IEEE
Higher order spatial features, such as doublets or
triplets have been used to incorporate spatial information
into the bag-of-local-features model. Due to computational
limits, ...
CONCUR
2010
Springer
13 years 9 months ago
2010
Springer
Many communication-centred systems today rely on asynchronous messaging among distributed peers to make efficient use of parallel execution and resource access. With such asynchron...
HPCA
2009
IEEE
14 years 9 months ago
2009
IEEE
The verification of an execution against memory consistency is known to be NP-hard. This paper proposes a novel fast memory consistency verification method by identifying a new na...