Sciweavers

13784 search results - page 102 / 2757
» On Computing Functions with Uncertainty
Sort
View
SIGMOD
2007
ACM
181views Database» more  SIGMOD 2007»
14 years 9 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
HICSS
2007
IEEE
145views Biometrics» more  HICSS 2007»
14 years 3 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...
ISMIS
2003
Springer
14 years 2 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
ICCD
1992
IEEE
124views Hardware» more  ICCD 1992»
14 years 1 months ago
The ETCA Data-Flow Functional Computer for Real-Time Image Processing
This paper presents a data- ow computer, constituted of a large array of data- ow processors and programmed using a functional language, and its application to realtime image proc...
Georges Quénot, Bertrand Zavidovique
CORR
2011
Springer
144views Education» more  CORR 2011»
13 years 4 months ago
On Properties of the Minimum Entropy Sub-tree to Compute Lower Bounds on the Partition Function
— Computing the partition function and the marginals of a global probability distribution are two important issues in any probabilistic inference problem. In a previous work, we ...
Mehdi Molkaraie, Payam Pakzad