4372 search results - page 773 / 875 » Algorithmic Theories of Everything |
142
click to vote
MOBIHOC
2007
ACM
16 years 3 months ago
2007
ACM
We consider distributed opportunistic scheduling (DOS) in wireless ad-hoc networks, where many links contend for the same channel using random access. In such networks, distribute...
130
click to vote
MOBIHOC
2004
ACM
16 years 3 months ago
2004
ACM
An important performance consideration for wireless sensor networks is the amount of information collected by all the nodes in the network over the course of network lifetime. Sin...
127
click to vote
SODA
2010
ACM
16 years 1 months ago
2010
ACM
We study the computational complexity of some central analysis problems for One-Counter Markov Decision Processes (OC-MDPs), a class of finitely-presented, countable-state MDPs. O...
140
click to vote
ICS
2010
Tsinghua U.
16 years 1 months ago
2010
Tsinghua U.
: The generic problem of estimation and inference given a sequence of i.i.d. samples has been extensively studied in the statistics, property testing, and learning communities. A n...
145
click to vote
CVPR
2010
IEEE
16 years 20 days ago
2010
IEEE
In matching tasks in computer vision, and particularly in real-time tracking from video, there are generally strong priors available on absolute and relative correspondence locati...