Sciweavers

439 search results - page 43 / 88
» Choiceless Computation and Symmetry
Sort
View
DAC
2005
ACM
15 years 10 months ago
A new canonical form for fast boolean matching in logic synthesis and verification
? An efficient and compact canonical form is proposed for the Boolean matching problem under permutation and complementation of variables. In addition an efficient algorithm for co...
Afshin Abdollahi, Massoud Pedram
ACCV
2006
Springer
15 years 3 months ago
Biologically Motivated Perceptual Feature: Generalized Robust Invariant Feature
Abstract. In this paper, we present a new, biologically inspired perceptual feature to solve the selectivity and invariance issue in object recognition. Based on the recent findin...
Sungho Kim, In-So Kweon
PR
2008
90views more  PR 2008»
14 years 9 months ago
Fast computation of geometric moments using a symmetric kernel
This paper presents a novel set of geometric moments with symmetric kernel (SGM) obtained using an appropriate transformation of image coordinates. By using this image transformat...
Chong-Yaw Wee, Paramesran Raveendran, R. Mukundan
CONCUR
2006
Springer
14 years 11 months ago
Model Checking Quantified Computation Tree Logic
Propositional temporal logic is not suitable for expressing properties on the evolution of dynamically allocated entities over time. In particular, it is not possible to trace such...
Arend Rensink
IJCSA
2008
137views more  IJCSA 2008»
14 years 9 months ago
Algorithms to Improve Performance of Natural Language Interface
: Performance of Natural Language Interface often deteriorates due to linguistic phenomena of Semantic Symmetry and Ambiguous Modification (Katz and Lin, 2003). In this paper we pr...
M. R. Joshi, R. A. Akerkar