Sciweavers

301 search results - page 13 / 61
» Probabilistic rough set approximations
Sort
View
RSCTC
2004
Springer
121views Fuzzy Logic» more  RSCTC 2004»
14 years 26 days ago
On the Correspondence between Approximations and Similarity
Abstract. This paper focuses on the use and interpretation of approximate databases where both rough sets and indiscernibility partitions are generalized and replaced by approximat...
Patrick Doherty, Andrzej Szalas
CSFW
2007
IEEE
14 years 1 months ago
Approximated Computationally Bounded Simulation Relations for Probabilistic Automata
We study simulation relations for Probabilistic Automata that require transitions to be matched up to negligible sets provided that computation lengths are polynomially bounded. T...
Roberto Segala, Andrea Turrini
ACCV
2010
Springer
13 years 2 months ago
Continuous Surface-Point Distributions for 3D Object Pose Estimation and Recognition
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...
Renaud Detry, Justus H. Piater
FUIN
2002
108views more  FUIN 2002»
13 years 7 months ago
Approximate Entropy Reducts
We use information entropy measure to extend the rough set based notion of a reduct. We introduce the Approximate Entropy Reduction Principle (AERP). It states that any simplificat...
Dominik Slezak
ENTCS
2007
85views more  ENTCS 2007»
13 years 7 months ago
Proving Approximate Implementations for Probabilistic I/O Automata
In this paper we introduce the notion of approximate implementations for Probabilistic I/O Automata (PIOA) and develop methods for proving such relationships. We employ a task str...
Sayan Mitra, Nancy A. Lynch