Sciweavers

3055 search results - page 55 / 611
» Randomized Search Trees
Sort
View
KDD
2000
ACM
110views Data Mining» more  KDD 2000»
14 years 19 days ago
An empirical analysis of techniques for constructing and searching k-dimensional trees
Affordable, fast computers with large memories have lessened the demand for program efficiency, but applications such as browsing and searching very large databases often have rat...
Douglas A. Talbert, Douglas H. Fisher
SWAT
1994
Springer
126views Algorithms» more  SWAT 1994»
14 years 1 months ago
Optimal Parametric Search on Graphs of Bounded Tree-Width
We give linear-time algorithms for a class of parametric search problems on weighted graphs of bounded tree-width. We also discuss the implications of our results to approximate p...
David Fernández-Baca, Giora Slutzki
RSA
2010
118views more  RSA 2010»
13 years 7 months ago
Weight of a link in a shortest path tree and the Dedekind Eta function
The weight of a randomly chosen link in the shortest path tree on the complete graph with exponential i.i.d. link weights is studied. The corresponding exact probability generatin...
Piet Van Mieghem
FSTTCS
1991
Springer
14 years 17 days ago
Randomizing Reductions of Search Problems
This paper closes a gap in the foundations of the theory of average case complexity. First, we clarify the notion of a feasible solution for a search problem and prove its robustne...
Andreas Blass, Yuri Gurevich
KDD
2003
ACM
113views Data Mining» more  KDD 2003»
14 years 9 months ago
Using randomized response techniques for privacy-preserving data mining
Privacy is an important issue in data mining and knowledge discovery. In this paper, we propose to use the randomized response techniques to conduct the data mining computation. S...
Wenliang Du, Zhijun Zhan