Sciweavers

11991 search results - page 2398 / 2399
» Data Structure Fusion
Sort
View
EDBT
2012
ACM
299views Database» more  EDBT 2012»
11 years 9 months ago
RecStore: an extensible and adaptive framework for online recommender queries inside the database engine
Most recommendation methods (e.g., collaborative filtering) consist of (1) a computationally intense offline phase that computes a recommender model based on users’ opinions o...
Justin J. Levandoski, Mohamed Sarwat, Mohamed F. M...
ICALP
2009
Springer
14 years 7 months ago
Counting Subgraphs via Homomorphisms
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...
Omid Amini, Fedor V. Fomin, Saket Saurabh
P2P
2008
IEEE
222views Communications» more  P2P 2008»
14 years 1 months ago
IgorFs: A Distributed P2P File System
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...
Bernhard Amann, Benedikt Elser, Yaser Houri, Thoma...
CIKM
2007
Springer
14 years 1 months ago
Optimal proactive caching in peer-to-peer network: analysis and application
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...
Weixiong Rao, Lei Chen 0002, Ada Wai-Chee Fu, Ying...
SIAMCOMP
1998
114views more  SIAMCOMP 1998»
13 years 7 months ago
Universal Limit Laws for Depths in Random Trees
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...
Luc Devroye
« Prev « First page 2398 / 2399 Last » Next »