Sciweavers

381 search results - page 29 / 77
» On the advantage over a random assignment
Sort
View
TMC
2011
201views more  TMC 2011»
13 years 2 months ago
Data Delivery Properties of Human Contact Networks
—Pocket Switched Networks take advantage of social contacts to opportunistically create data paths over time. This work employs empirical traces to examine the effect of the huma...
Nishanth Sastry, D. Manjunath, Karen R. Sollins, J...
SIGIR
2008
ACM
13 years 7 months ago
A unified and discriminative model for query refinement
This paper addresses the issue of query refinement, which involves reformulating ill-formed search queries in order to enhance relevance of search results. Query refinement typica...
Jiafeng Guo, Gu Xu, Hang Li, Xueqi Cheng
SODA
2008
ACM
104views Algorithms» more  SODA 2008»
13 years 9 months ago
Ranged hash functions and the price of churn
Ranged hash functions generalize hash tables to the setting where hash buckets may come and go over time, a typical case in distributed settings where hash buckets may correspond ...
James Aspnes, Muli Safra, Yitong Yin
ICML
2004
IEEE
14 years 8 months ago
Learning associative Markov networks
Markov networks are extensively used to model complex sequential, spatial, and relational interactions in fields as diverse as image processing, natural language analysis, and bio...
Benjamin Taskar, Vassil Chatalbashev, Daphne Kolle...
TIP
2010
121views more  TIP 2010»
13 years 2 months ago
Optimal PET Protection for Streaming Scalably Compressed Video Streams With Limited Retransmission Based on Incomplete Feedback
For streaming scalably compressed video streams over unreliable networks, Limited-Retransmission Priority Encoding Transmission (LR-PET) outperforms PET remarkably since the opport...
Ruiqin Xiong, David Taubman, Vijay Sivaraman