Sciweavers

2814 search results - page 452 / 563
» Competitive Analysis of Distributed Algorithms
Sort
View
P2P
2005
IEEE
104views Communications» more  P2P 2005»
14 years 2 months ago
Range Queries in Trie-Structured Overlays
Among the open problems in P2P systems, support for non-trivial search predicates, standardized query languages, distributed query processing, query load balancing, and quality of...
Anwitaman Datta, Manfred Hauswirth, Renault John, ...
WECWIS
2005
IEEE
137views ECommerce» more  WECWIS 2005»
14 years 2 months ago
Using Singular Value Decomposition Approximation for Collaborative Filtering
Singular Value Decomposition (SVD), together with the Expectation-Maximization (EM) procedure, can be used to find a low-dimension model that maximizes the loglikelihood of obser...
Sheng Zhang, Weihong Wang, James Ford, Fillia Make...
MIR
2005
ACM
133views Multimedia» more  MIR 2005»
14 years 2 months ago
Probabilistic web image gathering
We propose a new method for automated large scale gathering of Web images relevant to specified concepts. Our main goal is to build a knowledge base associated with as many conce...
Keiji Yanai, Kobus Barnard
DCOSS
2005
Springer
14 years 2 months ago
Routing Explicit Side Information for Data Compression in Wireless Sensor Networks
Abstract. Two difficulties in designing data-centric routes [2–5] in wireless sensor networks are the lack of reasonably practical data aggregation models and the high computatio...
Huiyu Luo, Gregory J. Pottie
SIGECOM
2003
ACM
110views ECommerce» more  SIGECOM 2003»
14 years 2 months ago
Virtual worlds: fast and strategyproof auctions for dynamic resource allocation
We consider the problem of designing fast and strategyproof exchanges for dynamic resource allocation problems in distributed systems. The exchange is implemented as a sequence of...
Chaki Ng, David C. Parkes, Margo I. Seltzer