Sciweavers

6167 search results - page 1029 / 1234
» Can Refinement be Automated
Sort
View
FGR
2000
IEEE
141views Biometrics» more  FGR 2000»
14 years 2 months ago
Memory-Based Face Recognition for Visitor Identification
We show that a simple, memory-based technique for appearance-based face recognition, motivated by the realworld task of visitor identification, can outperform more sophisticated a...
Terence Sim, Rahul Sukthankar, Matthew D. Mullin, ...
FPL
2000
Springer
128views Hardware» more  FPL 2000»
14 years 2 months ago
Verification of Dynamically Reconfigurable Logic
This paper reports on a method for extending existing VHDL design and verification software available for the Xilinx Virtex series of FPGAs. It allows the designer to apply standa...
David Robinson, Patrick Lysaght
DEXA
1997
Springer
179views Database» more  DEXA 1997»
14 years 2 months ago
Linking Object-Oriented Conceptual Modeling with Object-Oriented Implementation in Java
Nowadays, if we want to obtain a sound and correct final software product it is very important to be able to properly join modern OO programming environments, which are built for ...
Oscar Pastor, Emilio Insfrán, Vicente Pelec...
RTA
1995
Springer
14 years 1 months ago
Completion for Multiple Reduction Orderings
We present a completion procedure (called MKB) that works for multiple reduction orderings. Given equations and a set of reduction orderings, the procedure simulates a computation ...
Masahito Kurihara, Hisashi Kondo, Azuma Ohuchi
PODS
1991
ACM
131views Database» more  PODS 1991»
14 years 1 months ago
Termination Detection in Logic Programs using Argument Sizes
d Abstract Kirack Sohn and Allen Van Gelder University of California, Santa Cruz Progress on automated termination detection for logic programs is reported. The prospects for han...
Kirack Sohn, Allen Van Gelder
« Prev « First page 1029 / 1234 Last » Next »