598 search results - page 104 / 120 » A random graph model for massive graphs |
181
Voted
MOBIHOC
2009
ACM
16 years 6 months ago
2009
ACM
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...
163
click to vote
PODC
2005
ACM
15 years 11 months ago
2005
ACM
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...
166
click to vote
AAAI
2008
15 years 8 months ago
2008
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...
138
click to vote
ICMCS
2007
IEEE
16 years 2 days ago
2007
IEEE
We propose a discriminative learning approach for fusing multichannel sequential data with application to detect unsafe driving patterns from multi-channel driving recording data....
140
click to vote
CPAIOR
2007
Springer
15 years 12 months ago
2007
Springer
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...