Sciweavers

2440 search results - page 319 / 488
» Data-Intensive Question Answering
Sort
View
ICDM
2010
IEEE
121views Data Mining» more  ICDM 2010»
15 years 4 months ago
Recommending Social Events from Mobile Phone Location Data
A city offers thousands of social events a day, and it is difficult for dwellers to make choices. The combination of mobile phones and recommender systems can change the way one de...
Daniele Quercia, Neal Lathia, Francesco Calabrese,...
AOSD
2011
ACM
15 years 1 months ago
Closure joinpoints: block joinpoints without surprises
Block joinpoints allow programmers to explicitly mark regions of base code as “to be advised”, thus avoiding the need to extract the block into a method just for the sake of c...
Eric Bodden
CORR
2011
Springer
191views Education» more  CORR 2011»
15 years 1 months ago
On Approximating Four Covering and Packing Problems
In this paper, we consider approximability issues of the following four problems: triangle packing, full sibling reconstruction, maximum profit coverage and 2-coverage. All of th...
Mary V. Ashley, Tanya Y. Berger-Wolf, Piotr Berman...
TIT
2010
146views Education» more  TIT 2010»
15 years 1 months ago
Cooperation with an untrusted relay: a secrecy perspective
We consider the communication scenario where a source-destination pair wishes to keep the information secret from a relay node despite wanting to enlist its help. For this scenario...
Xiang He, Aylin Yener
MONET
2011
14 years 9 months ago
Distributed Coalition Formation Games for Secure Wireless Transmission
Cooperation among wireless nodes has been recently proposed for improving the physical layer (PHY) security of wireless transmission in the presence of multiple eavesdroppers. Whil...
Walid Saad, Zhu Han, Tamer Basar, Mérouane ...