Sciweavers

248 search results - page 45 / 50
» Towards a Theory of Context Spaces
Sort
View
TON
2008
107views more  TON 2008»
13 years 7 months ago
Efficient routing in intermittently connected mobile networks: the multiple-copy case
Abstract--Intermittently connected mobile networks are wireless networks where most of the time there does not exist a complete path from the source to the destination. There are m...
Thrasyvoulos Spyropoulos, Konstantinos Psounis, Ca...
JSAC
2007
97views more  JSAC 2007»
13 years 7 months ago
R2: Random Push with Random Network Coding in Live Peer-to-Peer Streaming
— In information theory, it has been shown that network coding can effectively improve the throughput of multicast communication sessions in directed acyclic graphs. More practic...
Mea Wang, Baochun Li
ATAL
2011
Springer
12 years 7 months ago
Quality-bounded solutions for finite Bayesian Stackelberg games: scaling up
The fastest known algorithm for solving General Bayesian Stackelberg games with a finite set of follower (adversary) types have seen direct practical use at the LAX airport for o...
Manish Jain, Christopher Kiekintveld, Milind Tambe
MM
2004
ACM
118views Multimedia» more  MM 2004»
14 years 1 months ago
Articulation, the letter, and the spirit in the aesthetics of narrative
A furthered understanding of the aesthetic aspects of narrative is important to both people and machines who wish to author pleasing narratives. This paper gives an account of the...
Hugo Liu
KDD
2002
ACM
104views Data Mining» more  KDD 2002»
14 years 8 months ago
Generalization Methods in Bioinformatics
Protein secondary structure prediction and high-throughput drug screen data mining are two important applications in bioinformatics. The data is represented in sparse feature spac...
Steven Eschrich, Nitesh V. Chawla, Lawrence O. Hal...