Sciweavers

2783 search results - page 548 / 557
» The Nature Of Near-Synonymic Relations
Sort
View
AML
2005
101views more  AML 2005»
14 years 9 months ago
Forcing and antifoundation
It is proved that the forcing apparatus can be built and set to work in ZFCA (=ZFC minus foundation plus the antifoundation axiom AFA). The key tools for this construction are gre...
Athanassios Tzouvaras
INFORMATICALT
2007
136views more  INFORMATICALT 2007»
14 years 9 months ago
Generic Multimedia Database Architecture Based upon Semantic Libraries
Semantic-based storage and retrieval of multimedia data requires accurate annotation of the data. Annotation can be done either manually or automatically. The retrieval performance...
Omara Abdul Hamid, Muhammad Abdul Qadir, Nadeem If...
BC
2005
101views more  BC 2005»
14 years 9 months ago
A control theory approach to the analysis and synthesis of the experimentally observed motion primitives
Recent experiments on frogs and rats, have led to the hypothesis that sensory-motor systems are organized into a finite number of linearly combinable modules; each module generates...
Francesco Nori, Ruggero Frezza
103
Voted
IPM
2007
156views more  IPM 2007»
14 years 9 months ago
p2pDating: Real life inspired semantic overlay networks for Web search
We consider a network of autonomous peers forming a logically global but physically distributed search engine, where every peer has its own local collection generated by independe...
Josiane Xavier Parreira, Sebastian Michel, Gerhard...
JACM
2007
84views more  JACM 2007»
14 years 9 months ago
Polymorphic higher-order recursive path orderings
This paper extends the termination proof techniques based on reduction orderings to a higher-order setting, by defining a family of recursive path orderings for terms of a typed ...
Jean-Pierre Jouannaud, Albert Rubio