Sciweavers

467 search results - page 31 / 94
» Designer Definites in Logical Form
Sort
View
ARITH
2009
IEEE
14 years 3 months ago
Unified Approach to the Design of Modulo-(2n +/- 1) Adders Based on Signed-LSB Representation of Residues
Moduli of the form 2n ± 1, which greatly simplify certain arithmetic operations in residue number systems (RNS), have been of longstanding interest. A steady stream of designs fo...
Ghassem Jaberipur, Behrooz Parhami
ADC
2006
Springer
128views Database» more  ADC 2006»
14 years 3 months ago
Horn clauses and functional dependencies in complex-value databases
We extend Fagin’s result on the equivalence between functional dependencies in relational databases and propositional Horn clauses. It is shown that this equivalence still holds...
Sven Hartmann, Sebastian Link
IUI
2003
ACM
14 years 2 months ago
MORE for less: model recovery from visual interfaces for multi-device application design
An emerging approach to multi-device application development developers to build an abstract semantic model that is translated into specific implementations for web browsers, PDAs...
Yves Gaeremynck, Lawrence D. Bergman, Tessa A. Lau
OOPSLA
2007
Springer
14 years 3 months ago
No ifs, ands, or buts: uncovering the simplicity of conditionals
Schematic tables are a new representation for conditionals. Roughly a cross between decision tables and data flow graphs, they represent computation and decision-making orthogona...
Jonathan Edwards
AAECC
2010
Springer
114views Algorithms» more  AAECC 2010»
13 years 9 months ago
Termination of narrowing via termination of rewriting
Abstract Narrowing extends rewriting with logic capabilities by allowing logic variables in terms and by replacing matching with unification. Narrowing has been widely used in diff...
Naoki Nishida, Germán Vidal