Sciweavers

1712 search results - page 27 / 343
» A Computational Approach to Binding Theory
Sort
View
AII
1989
15 years 3 months ago
Inductive Inference, DFAs, and Computational Complexity
This paper surveys recent results concerning the inference of deterministic finite automata (DFAs). The results discussed determine the extent to which DFAs can be feasibly inferr...
Leonard Pitt
EDOC
2005
IEEE
15 years 5 months ago
An Interactive Approach for Specifying OWL-S Groundings
12 OWL-S is an instance of the Web Ontology Language (OWL) that is used to describe and specify semantic web services. While OWL-S provides a promising mechanism for specification...
Gerald C. Gannod, Raynette J. Brodie, John T. E. T...
ARTCOM
2009
IEEE
15 years 6 months ago
Image Segmentation - A Survey of Soft Computing Approaches
—Soft Computing is an emerging field that consists of complementary elements of fuzzy logic, neural computing and evolutionary computation. Soft computing techniques have found w...
N. Senthilkumaran, R. Rajesh
CORR
2006
Springer
98views Education» more  CORR 2006»
14 years 11 months ago
A field-theory motivated approach to symbolic computer algebra
Field theory is an area in physics with a deceptively compact notation. Although general purpose computer algebra systems, built around generic list-based data structures, can be ...
Kasper Peeters
PERCOM
2009
ACM
16 years 10 days ago
RationalExposure: a Game Theoretic Approach to Optimize Identity Exposure in Pervasive Computing Environments
In pervasive computing environments, personal information is expressed in digital forms to a great extent. Daily activities and personal preferences may be easily associated with p...
Feng Zhu, Wei Zhu