4066 search results - page 361 / 814 » Almost Complete Sets |
165
click to vote
TPLP
2008
15 years 6 months ago
2008
We present in this paper a first-order axiomatization of an extended theory T of finite or infinite trees, built on a signature containing an infinite set of function symbols and ...
182
click to vote
CPC
2004
15 years 6 months ago
2004
We consider boolean functions over n variables. Any such function can be represented (and computed) by a complete binary tree with and or or in the internal nodes and a literal in...
145
click to vote
DATASCIENCE
2002
15 years 6 months ago
2002
A recurring theme during the CODATA 2000 conference (Lake Maggiore, Italy, 15 - 19 October 2000) was the increasing convergence in data-rich branches of science between the storag...
191
click to vote
TPDS
1998
15 years 6 months ago
1998
—We suggest a method of controlling the access to a secure database via quorum systems. A quorum system is a collection of sets (quorums) every two of which have a nonempty inter...
196
click to vote
CORR
2010
Springer
15 years 5 months ago
2010
Springer
Singular Value Decomposition (and Principal Component Analysis) is one of the most widely used techniques for dimensionality reduction: successful and efficiently computable, it ...