193 search results - page 18 / 39 » Rough Sets in Perception-Based Computing |
133
click to vote
BIRTHDAY
2000
Springer
15 years 7 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...
127
Voted
ICPR
2010
IEEE
15 years 3 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...
138
click to vote
ISVC
2010
Springer
15 years 1 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...
130
click to vote
ACCV
2010
Springer
14 years 10 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...
192
click to vote
PODC
2011
ACM
14 years 6 months 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...