1041 search results - page 102 / 209 » Randomizing Reductions of Search Problems |
CSE
2009
IEEE
14 years 2 months ago
2009
IEEE
Abstract—Extensive work has been devoted to private information retrieval and privacy preserving data mining. To protect user privacy from search engines, however, most current a...
ISAAC
2005
Springer
14 years 1 months ago
2005
Springer
Binary search trees are one of the most fundamental data structures. While the height of such a tree may be linear in the worst case, the average height with respect to the uniform...
SAT
2004
Springer
14 years 1 months ago
2004
Springer
2QBF is the problem of evaluating a Quantified Boolean Formula (QBF) with two levels of quantification. Many practical problems in sequential verification can be formulated as i...
GECCO
2009
Springer
14 years 2 months ago
2009
Springer
The bounded diameter minimum spanning tree problem is an NP-hard combinatorial optimization problem arising, for example, in network design when quality of service is of concern. ...
ICPP
2005
IEEE
14 years 1 months ago
2005
IEEE
Consider a heterogeneous cluster system, consisting of processors with varying processing capabilities and network links with varying bandwidths. Given a DAG application to be sch...