Sciweavers

440 search results - page 51 / 88
» On partial randomness
Sort
View
129
Voted
GISCIENCE
2008
Springer
112views GIS» more  GISCIENCE 2008»
15 years 4 months ago
Decentralized Movement Pattern Detection amongst Mobile Geosensor Nodes
Movement patterns, like flocking and converging, leading and following, are examples of high-level process knowledge derived from lowlevel trajectory data. Conventional techniques...
Patrick Laube, Matt Duckham, Thomas Wolle
155
Voted
IJCV
2006
236views more  IJCV 2006»
15 years 3 months ago
A Feature-based Approach for Dense Segmentation and Estimation of Large Disparity Motion
We present a novel framework for motion segmentation that combines the concepts of layer-based methods and feature-based motion estimation. We estimate the initial correspondences...
Josh Wills, Sameer Agarwal, Serge Belongie
139
Voted
TOC
2008
122views more  TOC 2008»
15 years 3 months ago
Derandomizing the Ahlswede-Winter matrix-valued Chernoff bound using pessimistic estimators, and applications
: Ahlswede and Winter [IEEE Trans. Inf. Th. 2002] introduced a Chernoff bound for matrix-valued random variables, which is a non-trivial generalization of the usual Chernoff bound ...
Avi Wigderson, David Xiao
138
Voted
COMPGEOM
1994
ACM
15 years 7 months ago
Computing Envelopes in Four Dimensions with Applications
Let F be a collection of n d-variate, possibly partially defined, functions, all algebraic of some constant maximum degree. We present a randomized algorithm that computes the vert...
Pankaj K. Agarwal, Boris Aronov, Micha Sharir
SAC
2010
ACM
15 years 10 months ago
Asynchronous Byzantine consensus with 2f+1 processes
Byzantine consensus in asynchronous message-passing systems has been shown to require at least 3f + 1 processes to be solvable in several system models (e.g., with failure detecto...
Miguel Correia, Giuliana Santos Veronese, Lau Cheu...