10997 search results - page 177 / 2200 » On the Structure of Complete Sets |
166
click to vote
BC
2005
15 years 6 months ago
2005
Recent experiments on frogs and rats, have led to the hypothesis that sensory-motor systems are organized into a finite number of linearly combinable modules; each module generates...
137
click to vote
NAACL
2003
15 years 8 months ago
2003
In this paper, we propose an automatic quantitative expansion method for a sentence set that contains sentences of the same meaning (called an equivalent sentence set). This task ...
208
click to vote
CRYPTO
2005
Springer
16 years 4 days ago
2005
Springer
A black-box secret sharing scheme (BBSSS) for a given access structure works in exactly the same way over any finite Abelian group, as it only requires black-box access to group o...
144
click to vote
STACS
1997
Springer
15 years 10 months ago
1997
Springer
We consider the problem of maintaining a set of n integers in the range 0::2w ? 1 under the operations of insertion, deletion, predecessor queries, minimum queries and maximum quer...
166
click to vote
FIMI
2003
15 years 8 months ago
2003
This paper presents the implementation of kDCI, an enhancement of DCI [10], a scalable algorithm for discovering frequent sets in large databases. The main contribution of kDCI re...