Sciweavers

240 search results - page 18 / 48
» Content Routing for Distributed Information Servers
Sort
View
KDD
2005
ACM
218views Data Mining» more  KDD 2005»
14 years 8 months ago
A maximum entropy web recommendation system: combining collaborative and content features
Web users display their preferences implicitly by navigating through a sequence of pages or by providing numeric ratings to some items. Web usage mining techniques are used to ext...
Xin Jin, Yanzan Zhou, Bamshad Mobasher
ICPP
1998
IEEE
14 years 5 days ago
Routing Algorithms for Anycast Messages
Use of anycast service can considerably simplify many communication applications. Two approaches can be used for routing anycast packets. Single-path routing always uses the same ...
Dong Xuan, Weijia Jia, Wei Zhao
WWW
2005
ACM
14 years 8 months ago
An environment for collaborative content acquisition and editing by coordinated ubiquitous devices
Digital content is not only stored by servers on the Internet, but also on various embedded devices belonging to ubiquitous networks. In this paper, we propose a content processin...
Yutaka Kidawara, Tomoyuki Uchiyama, Katsumi Tanaka
DEBS
2007
ACM
13 years 9 months ago
Chained forests for fast subsumption matching
Content delivery is becoming increasingly popular on the Internet. There are many ways to match content to subscribers. In this paper, we focus on subsumption-based matching. We p...
Sasu Tarkoma
WPES
2004
ACM
14 years 1 months ago
Privacy preserving route planning
The number of location-aware mobile devices has been rising for several years. As this trend continues, these devices may be able to use their location information to provide inte...
Keith B. Frikken, Mikhail J. Atallah