Sciweavers

1059 search results - page 62 / 212
» Improved Algorithms via Approximations of Probability Distri...
Sort
View
SIGIR
2005
ACM
15 years 3 months ago
Personalizing search via automated analysis of interests and activities
We formulate and study search algorithms that consider a user’s prior interactions with a wide variety of content to personalize that user’s current Web search. Rather than re...
Jaime Teevan, Susan T. Dumais, Eric Horvitz
INFOCOM
2011
IEEE
14 years 1 months ago
Optimizing network-coded cooperative communications via joint session grouping and relay node selection
Abstract—Network-coded cooperative communications (NCCC) is a new paradigm in wireless networks that employs network coding (NC) to improve the performance of CC. The core mechan...
Sushant Sharma, Yi Shi, Y. Thomas Hou, Hanif D. Sh...
ESA
2003
Springer
93views Algorithms» more  ESA 2003»
15 years 3 months ago
Improved Bounds for Finger Search on a RAM
We present a new finger search tree with O(1) worst-case update time and O(log log d) expected search time with high probability in the Random Access Machine (RAM) model of comput...
Alexis C. Kaporis, Christos Makris, Spyros Sioutas...
WWW
2011
ACM
14 years 4 months ago
Estimating sizes of social networks via biased sampling
Online social networks have become very popular in recent years and their number of users is already measured in many hundreds of millions. For various commercial and sociological...
Liran Katzir, Edo Liberty, Oren Somekh
ICC
2009
IEEE
135views Communications» more  ICC 2009»
14 years 7 months ago
Load Aware Broadcast in Mobile Ad Hoc Networks
In a wireless ad hoc network, the main issue of a good broadcast protocol is to attain maximum reachability with minimal packet forwarding. Existing protocols address this issue by...
Md. Tanvir Al Amin, Sukarna Barua, Sudip Vhaduri, ...