2434 search results - page 459 / 487 » Algorithmic Randomness of Closed Sets |
MOBIHOC
2009
ACM
16 years 28 days ago
2009
ACM
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...
KDD
2007
ACM
16 years 24 days ago
2007
ACM
In this paper we address the problem of detecting topics in large-scale linked document collections. Recently, topic detection has become a very active area of research due to its...
125
Voted
ICASSP
2009
IEEE
15 years 7 months ago
2009
IEEE
This paper considers the problem of scalable distributed coding of correlated sources that are communicated to a central unit. The general setting is typically encountered in sens...
113
Voted
IPPS
2008
IEEE
15 years 6 months ago
2008
IEEE
Many efforts have been made for addressing coverage problems in sensor networks. They fall into two categories, full coverage and barrier coverage, featured as static coverage. In...
109
click to vote
QEST
2007
IEEE
15 years 6 months ago
2007
IEEE
We investigate logics and equivalence relations that capture the qualitative behavior of Markov Decision Processes (MDPs). We present Qualitative Randomized Ctl (Qrctl): formulas o...