Sciweavers

8655 search results - page 1515 / 1731
» Challenges for Trusted Computing
Sort
View
125
Voted
MOBIHOC
2009
ACM
16 years 4 months ago
Delay and effective throughput of wireless scheduling in heavy traffic regimes: vacation model for complexity
Distributed scheduling algorithms for wireless ad hoc networks have received substantial attention over the last decade. The complexity levels of these algorithms span a wide spec...
Yung Yi, Junshan Zhang, Mung Chiang
113
Voted
MOBIHOC
2009
ACM
16 years 4 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
147
Voted
MOBIHOC
2009
ACM
16 years 4 months ago
Fault tolerant target tracking in sensor networks
In this paper, we present a Gaussian mixture model based approach to capture the spatial characteristics of any target signal in a sensor network, and further propose a temporally...
Min Ding, Xiuzhen Cheng
144
Voted
MOBIHOC
2009
ACM
16 years 4 months ago
Aging rules: what does the past tell about the future in mobile ad-hoc networks?
The study in mobile ad-hoc networks (MANET) is facing challenges brought by recent discovery of non-exponential behavior of the inter-contact time distribution of mobile nodes. In...
Han Cai, Do Young Eun
KDD
2008
ACM
119views Data Mining» more  KDD 2008»
16 years 4 months ago
SAIL: summation-based incremental learning for information-theoretic clustering
Information-theoretic clustering aims to exploit information theoretic measures as the clustering criteria. A common practice on this topic is so-called INFO-K-means, which perfor...
Junjie Wu, Hui Xiong, Jian Chen
« Prev « First page 1515 / 1731 Last » Next »