Sciweavers

4536 search results - page 184 / 908
» Contention-Sensitive Data Structures and Algorithms
Sort
View
KDD
2008
ACM
147views Data Mining» more  KDD 2008»
14 years 10 months ago
Structured learning for non-smooth ranking losses
Learning to rank from relevance judgment is an active research area. Itemwise score regression, pairwise preference satisfaction, and listwise structured learning are the major te...
Soumen Chakrabarti, Rajiv Khanna, Uma Sawant, Chir...
KDD
2008
ACM
183views Data Mining» more  KDD 2008»
14 years 10 months ago
Knowledge transfer via multiple model local structure mapping
The effectiveness of knowledge transfer using classification algorithms depends on the difference between the distribution that generates the training examples and the one from wh...
Jing Gao, Wei Fan, Jing Jiang, Jiawei Han
ICDM
2005
IEEE
109views Data Mining» more  ICDM 2005»
14 years 3 months ago
Triple Jump Acceleration for the EM Algorithm
This paper presents the triple jump framework for accelerating the EM algorithm and other bound optimization methods. The idea is to extrapolate the third search point based on th...
Han-Shen Huang, Bou-Ho Yang, Chun-Nan Hsu
SIS
2004
13 years 11 months ago
Efficient Tree Search in Encrypted Data
Abstract. Sometimes there is a need to store sensitive data on an untrusted database server. Song, Wagner and Perrig have introduced a way to search for the existence of a word in ...
Richard Brinkman, Ling Feng, Jeroen Doumen, Pieter...
EDBT
1998
ACM
155views Database» more  EDBT 1998»
14 years 1 months ago
Improving the Query Performance of High-Dimensional Index Structures by Bulk-Load Operations
Abstract. In this paper, we propose a new bulk-loading technique for high-dimensional indexes which represent an important component of multimedia database systems. Since it is ver...
Stefan Berchtold, Christian Böhm, Hans-Peter ...