Sciweavers

2925 search results - page 68 / 585
» Information Complexity of Online Problems
Sort
View
INFOCOM
2010
IEEE
15 years 4 months ago
SlideOR: Online Opportunistic Network Coding in Wireless Mesh Networks
—Opportunistic routing significantly increases unicast throughput in wireless mesh networks by effectively utilizing the wireless broadcast medium. With network coding, opportun...
Yunfeng Lin, Ben Liang, Baochun Li
EDUTAINMENT
2008
Springer
15 years 7 months ago
Knowledge Discovery by Network Visualization
Hyperlinks among webpages are very important information and are widely used for webpage clustering and webpage ranking. With the explosive growth in the number of webpages availab...
Hong Zhou, Yingcai Wu, Ming-Yuen Chan, Huamin Qu, ...
SIGECOM
2008
ACM
188views ECommerce» more  SIGECOM 2008»
15 years 6 months ago
Predicting trusts among users of online communities: an epinions case study
Trust between a pair of users is an important piece of information for users in an online community (such as electronic commerce websites and product review websites) where users ...
Haifeng Liu, Ee-Peng Lim, Hady Wirawan Lauw, Minh-...
IPM
2008
139views more  IPM 2008»
15 years 6 months ago
Complex adaptive filtering user profile using graphical models
This article explores how to develop complex data driven user models that go beyond the bag of words model and topical relevance. We propose to learn from rich user specific info...
Yi Zhang 0001
QCQC
1998
Springer
115views Communications» more  QCQC 1998»
15 years 10 months ago
Quantum Entanglement and the Communication Complexity of the Inner Product Function
Abstract. We consider the communication complexity of the binary inner product function in a variation of the two-party scenario where the parties have an a priori supply of partic...
Richard Cleve, Wim van Dam, Michael Nielsen, Alain...