2434 search results - page 114 / 487 » Algorithmic Randomness of Closed Sets |
158
click to vote
COCO
1994
Springer
15 years 7 months ago
1994
Springer
A probabilistically checkable debate system (PCDS) for a language L consists of a probabilisticpolynomial-time veri er V and a debate between Player 1, who claims that the input x ...
137
Voted
MOBIHOC
2008
ACM
16 years 3 months ago
2008
ACM
Dealing with interference is one of the primary challenges to solve in the design of protocols for wireless ad-hoc networks. Most of the work in the literature assumes localized o...
137
Voted
FOCS
2006
IEEE
15 years 9 months ago
2006
IEEE
A family of subsets C of [n] def = {1, . . . , n} is (r, t)exclusive if for every S ⊂ [n] of size at least n − r, there exist S1, . . . , St ∈ C with S = S1∪S2∪· · · ...
136
Voted
ICIP
1999
IEEE
15 years 7 months ago
1999
IEEE
Segmentation of motion in an image sequence is one of the most challenging problems in image processing, while at the same time one that finds numerous applications. To date, a wea...
147
click to vote
IJRR
2010
15 years 2 months ago
2010
The solution to the problem of mapping an environment and at the same time using this map to localize (the simultaneous localization and mapping, SLAM, problem) is a key prerequis...