Sciweavers

611 search results - page 24 / 123
» Index Sets of Computable Structures with Decidable Theories
Sort
View
CVPR
1996
IEEE
14 years 2 days ago
Connectionist networks for feature indexing and object recognition
Feature indexing techniques are promising for object recognition since they can quickly reduce the set of possible matches for a set of image features. This work exploits another ...
Clark F. Olson
DNIS
2005
Springer
112views Database» more  DNIS 2005»
14 years 1 months ago
Modelling Peer-to-Peer Data Networks Under Complex System Theory
: A Peer-to-peer Data Network (PDN) is an open and evolving society of peer nodes that assemble into a network to share their data for mutual benefit. PDNs are enabled by distribu...
Cyrus Shahabi, Farnoush Banaei Kashani
DM
2008
77views more  DM 2008»
13 years 6 months ago
Perfect Skolem sets
A Skolem sequence is a sequence s1, s2, . . . , s2n (where si A = {1 . . . n}), each si occurs exactly twice in the sequence and the two occurrences are exactly si positions apar...
Gustav Nordh
DNA
2004
Springer
157views Bioinformatics» more  DNA 2004»
14 years 1 months ago
Bond-Free Languages: Formalizations, Maximality and Construction Methods
The problem of negative design of DNA languages is addressed, that is, properties and construction methods of large sets of words that prevent undesired bonds when used in DNA com...
Lila Kari, Stavros Konstantinidis, Petr Sosí...
DAC
2006
ACM
14 years 9 months ago
Predicate learning and selective theory deduction for a difference logic solver
Design and verification of systems at the Register-Transfer (RT) or behavioral level require the ability to reason at higher levels of abstraction. Difference logic consists of an...
Chao Wang, Aarti Gupta, Malay K. Ganai