Sciweavers

16430 search results - page 116 / 3286
» On Computable Tree Functions
Sort
View
200
Voted

Book
397views
17 years 1 months ago
Computational Semantics with Functional Programming
"This book on applications of logic in the semantic analysis of language pays the reader the compliment of not assuming anything about what he or she knows (in particular, no...
Jan van Eijck, Christina Unger
135
Voted
RSCTC
2000
Springer
147views Fuzzy Logic» more  RSCTC 2000»
15 years 7 months ago
Towards Rough Neural Computing Based on Rough Membership Functions: Theory and Application
This paper introduces a neural network architecture based on rough sets and rough membership functions. The neurons of such networks instantiate approximate reasoning in assessing ...
James F. Peters, Andrzej Skowron, Liting Han, Shee...
SIGMOD
2007
ACM
181views Database» more  SIGMOD 2007»
16 years 3 months ago
Progressive and selective merge: computing top-k with ad-hoc ranking functions
The family of threshold algorithm (i.e., TA) has been widely studied for efficiently computing top-k queries. TA uses a sort-merge framework that assumes data lists are pre-sorted...
Dong Xin, Jiawei Han, Kevin Chen-Chuan Chang
136
Voted
HICSS
2007
IEEE
145views Biometrics» more  HICSS 2007»
15 years 9 months ago
Next-Generation Software Engineering: Function Extraction for Computation of Software Behavior
The ultra-large-scale systems of the future require the transformation of software engineering into a computational discipline capable of fast and dependable software development....
Richard C. Linger, Mark G. Pleszkoch, Luanne Burns...
129
Voted
ISMIS
2003
Springer
15 years 8 months ago
Granular Computing Based on Rough Sets, Quotient Space Theory, and Belief Functions
Abstract. A model of granular computing (GrC) is proposed by reformulating, re-interpreting, and combining results from rough sets, quotient space theory, and belief functions. Two...
Y. Y. Yao, Churn-Jung Liau, Ning Zhong