Sciweavers

831 search results - page 160 / 167
» Coalgebraic Correspondence Theory
Sort
View
FSS
2006
140views more  FSS 2006»
14 years 11 months ago
Advances and challenges in interval-valued fuzzy logic
Among the various extensions to the common [0, 1]-valued truth degrees of "traditional" fuzzy set theory, closed intervals of [0, 1] stand out as a particularly appealin...
Chris Cornelis, Glad Deschrijver, Etienne E. Kerre
JACM
2006
99views more  JACM 2006»
14 years 11 months ago
Finding a maximum likelihood tree is hard
Abstract. Maximum likelihood (ML) is an increasingly popular optimality criterion for selecting evolutionary trees [Felsenstein 1981]. Finding optimal ML trees appears to be a very...
Benny Chor, Tamir Tuller
JC
2006
86views more  JC 2006»
14 years 11 months ago
Randomly shifted lattice rules for unbounded integrands
We study the problem of multivariate integration over Rd with integrands of the form f(x)d(x) where d is a probability density function. Practical problems of this form occur comm...
Frances Y. Kuo, Grzegorz W. Wasilkowski, Benjamin ...
DSS
2007
226views more  DSS 2007»
14 years 11 months ago
Dare to share: Protecting sensitive knowledge with data sanitization
chool of Business Research – FY 2007 Research Abstracts Dare to Share: Protecting Sensitive Knowledge with Data Sanitization Data sanitization is a process that is used to promot...
Ali Amiri
SIAMCOMP
2008
72views more  SIAMCOMP 2008»
14 years 11 months ago
Plottable Real Number Functions and the Computable Graph Theorem
The Graph Theorem of classical recursion theory states that a total function on the natural numbers is computable, if and only if its graph is recursive. It is known that this res...
Vasco Brattka