Sciweavers

441 search results - page 62 / 89
» Query expansion using random walk models
Sort
View
ICOIN
2004
Springer
14 years 3 months ago
On Reducing Paging Cost in IP-Based Wireless/Mobile Networks
For more scalable mobile services, it is important to reduce the signaling cost for location management. In this paper, we propose a cost effective IP paging scheme utilizing expl...
Kyoungae Kim, Sangheon Pack, Yanghee Choi
TKDE
2008
107views more  TKDE 2008»
13 years 9 months ago
Adaptive Broadcasting for Similarity Queries in Wireless Content Delivery Systems
We present a new adaptive and energy-efficient broadcast model to support flexible responses to client queries. Clients do not have to request documents by name, since they may kno...
Wei Wang, Chinya V. Ravishankar
ASIACRYPT
2004
Springer
14 years 3 months ago
Eliminating Random Permutation Oracles in the Even-Mansour Cipher
Abstract. Even and Mansour [EM97] proposed a block cipher construction that takes a publicly computable random permutation oracle P and XORs different keys prior to and after appl...
Craig Gentry, Zulfikar Ramzan
AUSDM
2007
Springer
107views Data Mining» more  AUSDM 2007»
14 years 4 months ago
Preference Networks: Probabilistic Models for Recommendation Systems
Recommender systems are important to help users select relevant and personalised information over massive amounts of data available. We propose an unified framework called Prefer...
Tran The Truyen, Dinh Q. Phung, Svetha Venkatesh
CIAC
2006
Springer
97views Algorithms» more  CIAC 2006»
14 years 1 months ago
Network Discovery and Verification with Distance Queries
The network discovery (verification) problem asks for a minimum subset Q V of queries in an undirected graph G = (V, E) such that these queries discover all edges and non-edges o...
Thomas Erlebach, Alexander Hall, Michael Hoffmann ...