4536 search results - page 137 / 908 » Contention-Sensitive Data Structures and Algorithms |
STOC
2003
ACM
14 years 9 months ago
2003
ACM
Given an undirected graph or an Eulerian directed graph G and a subset S of its vertices, we show how to determine the edge connectivity C of the vertices in S in time O(C3 n log ...
JPDC
2006
13 years 9 months ago
2006
Irregular parallel algorithms pose a significant challenge for achieving high performance because of the difficulty predicting memory access patterns or execution paths. Within an...
ICDE
2007
IEEE
14 years 3 months ago
2007
IEEE
Recommendation systems generally produce the results of their output to their users in the form of an ordinal list. In the interest of simplicity, these lists are often obscure, ,...
ITICSE
1999
ACM
14 years 1 months ago
1999
ACM
Computer animation is an excellent medium for capturing the dynamic nature of data structure manipulations, and can be used to advantage in the teaching of algorithms and data str...
CORR
2010
Springer
13 years 4 months ago
2010
Springer
Abstract: Transactional network data can be thought of as a list of oneto-many communications (e.g., email) between nodes in a social network. Most social network models convert th...