Sciweavers

2376 search results - page 340 / 476
» More Efficient Internal-Regret-Minimizing Algorithms
Sort
View
SIGIR
2005
ACM
14 years 3 months ago
A study of relevance propagation for web search
Different from traditional information retrieval, both content and structure are critical to the success of Web information retrieval. In recent years, many relevance propagation ...
Tao Qin, Tie-Yan Liu, Xu-Dong Zhang, Zheng Chen, W...
ISI
2005
Springer
14 years 3 months ago
Information Supply Chain: A Unified Framework for Information-Sharing
To balance demand and supply of information, we propose a framework called “information supply chain” (ISC). This framework is based on supply chain management (SCM), which has...
Shuang Sun, John Yen
FOCS
1999
IEEE
14 years 2 months ago
Near-Optimal Conversion of Hardness into Pseudo-Randomness
Various efforts ([?, ?, ?]) have been made in recent years to derandomize probabilistic algorithms using the complexity theoretic assumption that there exists a problem in E = dti...
Russell Impagliazzo, Ronen Shaltiel, Avi Wigderson
TMC
2010
138views more  TMC 2010»
13 years 8 months ago
Distributed Relay-Assignment Protocols for Coverage Expansion in Cooperative Wireless Networks
—One important application of cooperative communications is to extend coverage area in wireless networks without increasing infrastructure. However, a crucial challenge in implem...
Ahmed K. Sadek, Zhu Han, K. J. Ray Liu
DLS
2010
204views Languages» more  DLS 2010»
13 years 8 months ago
Alias analysis for optimization of dynamic languages
Dynamic languages such as Python allow programs to be written more easily using high-level constructs such as comprehensions for queries and using generic code. Efficient executio...
Michael Gorbovitski, Yanhong A. Liu, Scott D. Stol...