3172 search results - page 162 / 635 » On the Random-Self-Reducibility of Complete Sets |
204
click to vote
ICDE
2009
IEEE
15 years 4 months ago
2009
IEEE
There is a huge wealth of sequence data available, for example, customer purchase histories, program execution traces, DNA, and protein sequences. Analyzing this wealth of data to ...
245
click to vote
STOC
2012
ACM
13 years 9 months ago
2012
ACM
We obtain a characterization of feasible, Bayesian, multi-item multi-bidder mechanisms with independent, additive bidders as distributions over hierarchical mechanisms. Combined w...
168
click to vote
AAAI
1990
15 years 7 months ago
1990
This work pertains to the Knuth-Bendix (KB) algorithm which tries to find a complete set of reductions from a given set of equations. In the KB algorithm a term ordering is employ...
123
click to vote
CIKM
1997
Springer
15 years 10 months ago
1997
Springer
In this paper, we present a complete analysis of redundant relationships in the entity-relationship model. Existing approaches use the concept of functional dependencies for ident...
174
click to vote
APAL
2010
15 years 6 months ago
2010
Locatedness is one of the fundamental notions in constructive mathematics. The existence of a positivity predicate on a locale, i.e. the locale being overt, or open, has proved to ...