4007 search results - page 347 / 802 » Computation with imprecise probabilities |
215
click to vote
ATAL
2008
Springer
15 years 9 months ago
2008
Springer
Complexity theory is a useful tool to study computational issues surrounding the elicitation of preferences, as well as the strategic manipulation of elections aggregating togethe...
195
click to vote
FOCS
2005
IEEE
16 years 1 months ago
2005
IEEE
We prove the first non-trivial (super linear) lower bound in the noisy broadcast model, defined by El Gamal in [6]. In this model there are n + 1 processors P0, P1, . . . , Pn, ...
427
click to vote
Tutorial
"To be a good programmer is difficult and noble. The hardest part of making real a collective vision of a software project is dealing with one's coworkers and customers. ...
208
click to vote
ICCV
2009
IEEE
17 years 16 days ago
2009
IEEE
We present some theoretical results related to the problem
of actively searching for a target in a 3D environment,
under the constraint of a maximum search time. We define
the o...
207
click to vote
ICCV
2009
IEEE
17 years 16 days ago
2009
IEEE
This paper introduces an algorithm for detecting walking
motion using point trajectories in video sequences. Given
a number of point trajectories, we identify those which are
sp...