1046 search results - page 71 / 210 » Approximation Algorithms for Domination Search |
92
Voted
PAKDD
2001
ACM
15 years 5 months ago
2001
ACM
Inclusion of domain knowledge in a process of knowledge discovery in databases is a complex but very important part of successful knowledge discovery solutions. In real-life data m...
88
Voted
TCC
2007
Springer
15 years 6 months ago
2007
Springer
Private approximation of search problems deals with finding approximate solutions to search problems while disclosing as little information as possible. The focus of this work is ...
102
Voted
CORR
2000
Springer
15 years 10 days ago
2000
Springer
The probability distribution P from which the history of our universe is sampled represents a theory of everything or TOE. We assume P is formally describable. Since most (uncount...
91
Voted
CIKM
2010
Springer
14 years 11 months ago
2010
Springer
Pseudo-relevance feedback (PRF) improves search quality by expanding the query using terms from high-ranking documents from an initial retrieval. Although PRF can often result in ...
83
Voted
BTW
2007
Springer
15 years 6 months ago
2007
Springer
B-tree and index into two layers of abstraction. In addition, this paper provides algorithms for (i) concurrency control and recovery including locking of individual keys and of co...