Sciweavers

3172 search results - page 207 / 635
» On the Random-Self-Reducibility of Complete Sets
Sort
View
WWW
2003
ACM
16 years 7 months ago
Conversation specification: a new approach to design and analysis of e-service composition
This paper introduces a framework for modeling and specifying the global behavior of e-service compositions. Under this framework, peers (individual e-services) communicate throug...
Tevfik Bultan, Xiang Fu, Richard Hull, Jianwen Su
KDD
2004
ACM
124views Data Mining» more  KDD 2004»
16 years 7 months ago
Support envelopes: a technique for exploring the structure of association patterns
This paper introduces support envelopes--a new tool for analyzing association patterns--and illustrates some of their properties, applications, and possible extensions. Specifical...
Michael Steinbach, Pang-Ning Tan, Vipin Kumar
ALT
2001
Springer
16 years 3 months ago
Learning How to Separate
The main question addressed in the present work is how to find effectively a recursive function separating two sets drawn arbitrarily from a given collection of disjoint sets. I...
Sanjay Jain, Frank Stephan
ICTAI
2007
IEEE
16 years 26 days ago
Establishing Logical Rules from Empirical Data
We review a method of generating logical rules, or axioms, from empirical data. This method, using closed set properties of formal concept analysis, has been previously described ...
John L. Pfaltz
RTA
2005
Springer
16 years 1 days ago
Arithmetic as a Theory Modulo
We present constructive arithmetic in Deduction modulo with rewrite rules only. In natural deduction and in sequent calculus, the cut elimination theorem and the analysis of the st...
Gilles Dowek, Benjamin Werner