Sciweavers

598 search results - page 104 / 120
» A random graph model for massive graphs
Sort
View
MOBIHOC
2009
ACM
16 years 13 days 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
PODC
2005
ACM
15 years 5 months ago
Maximal independent sets in radio networks
We study the distributed complexity of computing a maximal independent set (MIS) in radio networks with completely unknown topology, asynchronous wake-up, and no collision detecti...
Thomas Moscibroda, Roger Wattenhofer
AAAI
2008
15 years 2 months ago
CIGAR: Concurrent and Interleaving Goal and Activity Recognition
In artificial intelligence and pervasive computing research, inferring users' high-level goals from activity sequences is an important task. A major challenge in goal recogni...
Derek Hao Hu, Qiang Yang
ICMCS
2007
IEEE
112views Multimedia» more  ICMCS 2007»
15 years 6 months ago
Detecting Unsafe Driving Patterns using Discriminative Learning
We propose a discriminative learning approach for fusing multichannel sequential data with application to detect unsafe driving patterns from multi-channel driving recording data....
Yue Zhou, Wei Xu, Huazhong Ning, Yihong Gong, Thom...
CPAIOR
2007
Springer
15 years 6 months ago
Best-First AND/OR Search for 0/1 Integer Programming
Abstract. AND/OR search spaces are a unifying paradigm for advanced algorithmic schemes for graphical models. The main virtue of this representation is its sensitivity to the struc...
Radu Marinescu 0002, Rina Dechter