Sciweavers

3131 search results - page 542 / 627
» Generalized connection caching
Sort
View
AAAI
2012
12 years 12 days ago
Multinomial Relation Prediction in Social Data: A Dimension Reduction Approach
The recent popularization of social web services has made them one of the primary uses of the World Wide Web. An important concept in social web services is social actions such as...
Nozomi Nori, Danushka Bollegala, Hisashi Kashima
CONEXT
2009
ACM
13 years 11 months ago
Cool-Tether: energy efficient on-the-fly wifi hot-spots using mobile phones
We consider the problem of providing ubiquitous yet affordable Internet connectivity to devices at home, at work, and on the move. In this context, we take advantage of two signif...
Ashish Sharma, Vishnu Navda, Ramachandran Ramjee, ...
PODC
2004
ACM
14 years 3 months ago
Analyzing Kleinberg's (and other) small-world Models
We analyze the properties of Small-World networks, where links are much more likely to connect “neighbor nodes” than distant nodes. In particular, our analysis provides new re...
Charles U. Martel, Van Nguyen
SASN
2004
ACM
14 years 3 months ago
Securing quality-of-service route discovery in on-demand routing for ad hoc networks
An ad hoc network is a collection of computers (nodes) that cooperate to forward packets for each other over a multihop wireless network. Users of such networks may wish to use de...
Yih-Chun Hu, David B. Johnson
CORR
2007
Springer
126views Education» more  CORR 2007»
13 years 10 months ago
Dial a Ride from k-forest
The k-forest problem is a common generalization of both the k-MST and the dense-k-subgraph problems. Formally, given a metric space on n vertices V , with m demand pairs ⊆ V × ...
Anupam Gupta, MohammadTaghi Hajiaghayi, Viswanath ...