193 search results - page 18 / 39 » Rough Sets in Perception-Based Computing |
BIRTHDAY
2000
Springer
14 years 2 months ago
2000
Springer
Bistructures are a generalisation of event structures which allow a representation of spaces of functions at higher types in an orderextensional setting. The partial order of caus...
ICPR
2010
IEEE
13 years 10 months ago
2010
IEEE
The conventional mean shift algorithm has been known to be sensitive to selecting a bandwidth. We present a robust mean shift algorithm with heterogeneous node weights that come f...
ISVC
2010
Springer
13 years 7 months ago
2010
Springer
We present a method for visual classification of actions and events captured from an egocentric point of view. The method tackles the challenge of a moving camera by creating defor...
ACCV
2010
Springer
13 years 4 months ago
2010
Springer
We present a 3D, probabilistic object-surface model, along with mechanisms for probabilistically integrating unregistered 2.5D views into the model, and for segmenting model instan...
PODC
2011
ACM
13 years 20 days ago
2011
ACM
A maximal independent set on a graph is an inclusion-maximal set of mutually non-adjacent nodes. This basic symmetry breaking structure is vital for many distributed algorithms, w...