461 search results - page 34 / 93 » Splitting NP-Complete Sets |
109
Voted
EDBT
2000
ACM
15 years 4 months ago
2000
ACM
In this paper we present the Slim-tree, a dynamic tree for organizing metric datasets in pages of fixed size. The Slim-tree uses the "fat-factor" which provides a simple ...
100
Voted
ENTCS
2008
15 years 1 months ago
2008
d abstract) Peter Selinger1 Department of Mathematics and Statistics Dalhousie University, Halifax, Nova Scotia, Canada Dagger compact closed categories were studied by Abramsky a...
123
Voted
MOC
2002
15 years 24 days ago
2002
In this paper, we present several baby-step giant-step algorithms for the low hamming weight discrete logarithm problem. In this version of the discrete log problem, we are require...
103
click to vote
ACTA
2008
14 years 11 months ago
2008
We consider a model of random trees similar to the split trees of Devroye [30] in which a set of items is recursively partitioned. Our model allows for more flexibility in the cho...
99
Voted
LPNMR
1997
Springer
15 years 5 months ago
1997
Springer
This paper introduces power default reasoning (PDR), a framework for nonmonotonic reasoning based on the domain-theoretic idea of modeling default rules with partial-information i...