Sciweavers

733 search results - page 95 / 147
» Recommending random walks
Sort
View
IWDW
2004
Springer
15 years 3 months ago
A Multi-feature Based Invertible Authentication Watermarking for JPEG Images
: Invertible authentication techniques have been used in some special applications (such as medical or military) where original data can be recovered after authenticated. In this p...
Deng-Pan Ye, Yaobin Mao, Yuewei Dai, Zhiquan Wang
CSR
2010
Springer
15 years 2 months ago
Comparing Two Stochastic Local Search Algorithms for Constraint Satisfaction Problems
Abstract. In this survey we compare the similarities, differences and the complexities of two very different approaches to solve a general constraint satisfaction probblems (CSP). ...
Uwe Schöning
PAKDD
2010
ACM
179views Data Mining» more  PAKDD 2010»
15 years 2 months ago
Answer Diversification for Complex Question Answering on the Web
We present a novel graph ranking model to extract a diverse set of answers for complex questions via random walks over a negative-edge graph. We assign a negative sign to edge weig...
Palakorn Achananuparp, Xiaohua Hu, Tingting He, Ch...
PAKDD
2001
ACM
104views Data Mining» more  PAKDD 2001»
15 years 2 months ago
Optimizing the Induction of Alternating Decision Trees
The alternating decision tree brings comprehensibility to the performance enhancing capabilities of boosting. A single interpretable tree is induced wherein knowledge is distribute...
Bernhard Pfahringer, Geoffrey Holmes, Richard Kirk...
COLT
2000
Springer
15 years 2 months ago
Bias-Variance Error Bounds for Temporal Difference Updates
We give the first rigorous upper bounds on the error of temporal difference (td) algorithms for policy evaluation as a function of the amount of experience. These upper bounds pr...
Michael J. Kearns, Satinder P. Singh