11211 search results - page 2242 / 2243 » Data Structures |
PLDI
2012
ACM
11 years 8 months ago
2012
ACM
Approximate program transformations such as skipping tasks [29, 30], loop perforation [21, 22, 35], reduction sampling [38], multiple selectable implementations [3, 4, 16, 38], dy...
ICALP
2009
Springer
14 years 6 months ago
2009
Springer
We introduce a generic approach for counting subgraphs in a graph. The main idea is to relate counting subgraphs to counting graph homomorphisms. This approach provides new algori...
SIAMCOMP
1998
13 years 5 months ago
1998
Random binary search trees, b-ary search trees, median-of-(2k+1) trees, quadtrees, simplex trees, tries, and digital search trees are special cases of random split trees. For these...
P2P
2008
IEEE
14 years 16 days ago
2008
IEEE
IgorFs is a distributed, decentralized peer-to-peer (P2P) file system that is completely transparent to the user. It is built on top of the Igor peer-to-peer overlay network, whi...
CIKM
2007
Springer
14 years 10 days ago
2007
Springer
As a promising new technology with the unique properties like high efficiency, scalability and fault tolerance, Peer-toPeer (P2P) technology is used as the underlying network to b...