Sciweavers

608 search results - page 115 / 122
» Random Systems with Complete Connections
Sort
View
ICDE
2003
IEEE
157views Database» more  ICDE 2003»
14 years 11 months ago
Profile-Driven Cache Management
Modern distributed information systems cope with disconnection and limited bandwidth by using caches. In communicationconstrained situations, traditional demand-driven approaches ...
Mitch Cherniack, Eduardo F. Galvez, Michael J. Fra...
WWW
2007
ACM
14 years 10 months ago
Long distance wireless mesh network planning: problem formulation and solution
Several research efforts as well as deployments have chosen IEEE 802.11 as a low-cost, long-distance access technology to bridge the digital divide. In this paper, we consider the...
Sayandeep Sen, Bhaskaran Raman
MOBIHOC
2009
ACM
14 years 10 months ago
Predict and relay: an efficient routing in disruption-tolerant networks
Routing is one of the most challenging open problems in disruption-tolerant networks (DTNs) because of the shortlived wireless connectivity environment. To deal with this issue, r...
Quan Yuan, Ionut Cardei, Jie Wu
KDD
2005
ACM
153views Data Mining» more  KDD 2005»
14 years 10 months ago
Improving discriminative sequential learning with rare--but--important associations
Discriminative sequential learning models like Conditional Random Fields (CRFs) have achieved significant success in several areas such as natural language processing, information...
Xuan Hieu Phan, Minh Le Nguyen, Tu Bao Ho, Susumu ...
CCS
2007
ACM
14 years 3 months ago
Robust group key agreement using short broadcasts
A group key agreement protocol (GKA) allows a set of players to establish a shared secret key which can be used to secure a subsequent communication. Several efficient constantrou...
Stanislaw Jarecki, Jihye Kim, Gene Tsudik