Sciweavers

10148 search results - page 1729 / 2030
» Optimal sub-graphical models
Sort
View
220
Voted
WWW
2006
ACM
16 years 7 months ago
Semantic link based top-K join queries in P2P networks
An important issue arising from Peer-to-Peer applications is how to accurately and efficiently retrieve a set of K best matching data objects from different sources while minimizi...
Jie Liu, Liang Feng, Chao He
WWW
2003
ACM
16 years 7 months ago
On labeling schemes for the semantic web
This paper focuses on the optimization of the navigation through voluminous subsumption hierarchies of topics employed by Portal Catalogs like Netscape Open Directory (ODP). We ad...
Vassilis Christophides, Dimitris Plexousakis, Mich...
STOC
2009
ACM
133views Algorithms» more  STOC 2009»
16 years 7 months ago
Near-perfect load balancing by randomized rounding
We consider and analyze a new algorithm for balancing indivisible loads on a distributed network with n processors. The aim is minimizing the discrepancy between the maximum and m...
Tobias Friedrich, Thomas Sauerwald
CHI
2009
ACM
16 years 7 months ago
Product interest and engagement scale, beta (pies-beta): initial development
We report a work in progress: development and initial validation of the Product Interest and Engagement Scale (PIES), a short assessment instrument measuring consumer interest in ...
Christopher N. Chapman, Michal Lahav, Edwin Love, ...
MOBIHOC
2009
ACM
16 years 7 months ago
Improved bounds on the throughput efficiency of greedy maximal scheduling in wireless networks
Due to its low complexity, Greedy Maximal Scheduling (GMS), also known as Longest Queue First (LQF), has been studied extensively for wireless networks. However, GMS can result in...
Mathieu Leconte, Jian Ni, Rayadurgam Srikant
« Prev « First page 1729 / 2030 Last » Next »