9871 search results - page 150 / 1975 » On the Structure of Low Sets |
133
click to vote
NAACL
2003
15 years 7 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 ...
198
click to vote
CRYPTO
2005
Springer
15 years 12 months 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...
139
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...
164
click to vote
FIMI
2003
15 years 7 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...
134
click to vote
AUTOMATICA
2007
15 years 6 months ago
2007
This paper investigates simultaneous stabilization of a set of nonlinear port-controlled Hamiltonian (PCH) systems and proposes a number of results on the design of simultaneous s...