Sciweavers

254 search results - page 39 / 51
» Binary amiable Words
Sort
View
IOLTS
2005
IEEE
125views Hardware» more  IOLTS 2005»
15 years 4 months ago
Design of a Self Checking Reed Solomon Encoder
— In this paper, an innovative self-checking Reed Solomon encoder architecture is described. The presented architecture exploits some properties of the arithmetic operations in G...
Gian-Carlo Cardarilli, Salvatore Pontarelli, Marco...
SAC
2005
ACM
15 years 4 months ago
Learning decision trees from dynamic data streams
: This paper presents a system for induction of forest of functional trees from data streams able to detect concept drift. The Ultra Fast Forest of Trees (UFFT) is an incremental a...
João Gama, Pedro Medas, Pedro Pereira Rodri...
COMPSYSTECH
2007
15 years 2 months ago
A refinement model with information granulation focused on difficult to distinguish cases
: The paper proposes a different approach to data modeling. Analogous to the rejection method, where the misclassifications are removed and manually evaluated, we focus here on dif...
Plamena Andreeva, Plamen Andreev, Maya Dimitrova, ...
SI3D
1995
ACM
15 years 2 months ago
Shadow Volume BSP Trees for Computation of Shadows in Dynamic Scenes
This paper presents an algorithm for shadow calculation in dynamic polyhedral scenes illuminated by point light sources. It is based on a modi cation of Shadow Volume Binary Space...
Yiorgos Chrysanthou, Mel Slater
DLOG
2008
15 years 1 months ago
Consistency Checking for Extended Description Logics
In this paper we consider the extensions of description logics that were proposed to represent uncertain or vague knowledge, focusing on the fuzzy and possibilistic formalisms. We ...
Olivier Couchariere, Marie-Jeanne Lesot, Bernadett...