Sciweavers

759 search results - page 115 / 152
» What Can Be Implemented Anonymously
Sort
View
IDT
2010
125views more  IDT 2010»
13 years 8 months ago
Automatic fusion of knowledge stored in ontologies
A person adds new knowledge to his/her mind, taking into account new information, additional details, better precision, synonyms, homonyms, redundancies, apparent contradictions, a...
Alma-Delia Cuevas, Adolfo Guzmán-Arenas
IJCCBS
2010
105views more  IJCCBS 2010»
13 years 8 months ago
Software safety: relating software assurance and software integrity
: The overall safety integrity of a safety critical system, comprising both software and hardware, is typically specified quantitatively, e.g., in terms of failure rates. However, ...
Ibrahim Habli, Richard Hawkins, Tim Kelly
VTC
2010
IEEE
180views Communications» more  VTC 2010»
13 years 8 months ago
Dynamic Channel Reservation to Enhance Channel Access by Exploiting Structure of Vehicular Networks
Abstract—VANET protocols need to exploit the special structure of vehicular networks. This structure includes the onedimensional nature of roads, the structure of lanes, the grou...
Ray K. Lam, P. R. Kumar
CAP
2010
13 years 4 months ago
Parallel disk-based computation for large, monolithic binary decision diagrams
Binary Decision Diagrams (BDDs) are widely used in formal verification. They are also widely known for consuming large amounts of memory. For larger problems, a BDD computation wi...
Daniel Kunkle, Vlad Slavici, Gene Cooperman
FPGA
2004
ACM
119views FPGA» more  FPGA 2004»
14 years 3 months ago
A quantitative analysis of the speedup factors of FPGAs over processors
The speedup over a microprocessor that can be achieved by implementing some programs on an FPGA has been extensively reported. This paper presents an analysis, both quantitative a...
Zhi Guo, Walid A. Najjar, Frank Vahid, Kees A. Vis...