1996 search results - page 188 / 400 » Financial Theory 2 |
134
click to vote
WWW
2005
ACM
16 years 5 months ago
2005
ACM
Being able to determine the provenience of statements is a fundamental step in any SW trust modeling. We propose a methodology that allows signing of small groups of RDF statement...
145
click to vote
KDD
2006
ACM
16 years 5 months ago
2006
ACM
1 A bridging rule in this paper has its antecedent and action from different conceptual clusters. We first design two algorithms for mining bridging rules between clusters in a dat...
116
click to vote
STOC
2005
ACM
16 years 5 months ago
2005
ACM
Shortly after Steven Cook and Richard Karp showed the existence of many natural NP-complete languages, researchers started to realize the great importance of the P versus NP probl...
133
click to vote
STOC
2005
ACM
16 years 5 months ago
2005
ACM
We construct an efficient probabilistic algorithm that, given a finite set with a binary operation, tests if it is an abelian group. The distance used is an analogue of the edit d...
139
click to vote
ICFP
2008
ACM
16 years 4 months ago
2008
ACM
In the context of program verification in an interactive theorem prover, we study the problem of transforming function definitions with ML-style (possibly overlapping) pattern mat...