Sciweavers

7773 search results - page 1267 / 1555
» On generalized Frame-Stewart numbers
Sort
View
CIKM
2006
Springer
15 years 10 months ago
Optimisation methods for ranking functions with multiple parameters
Optimising the parameters of ranking functions with respect to standard IR rank-dependent cost functions has eluded satisfactory analytical treatment. We build on recent advances ...
Michael J. Taylor, Hugo Zaragoza, Nick Craswell, S...
CIKM
2006
Springer
15 years 10 months ago
Constrained subspace skyline computation
In this paper we introduce the problem of Constrained Subspace Skyline Queries. This class of queries can be thought of as a generalization of subspace skyline queries using range...
Evangelos Dellis, Akrivi Vlachou, Ilya Vladimirski...
CIVR
2006
Springer
201views Image Analysis» more  CIVR 2006»
15 years 10 months ago
Efficient Margin-Based Rank Learning Algorithms for Information Retrieval
Learning a good ranking function plays a key role for many applications including the task of (multimedia) information retrieval. While there are a few rank learning methods availa...
Rong Yan, Alexander G. Hauptmann
FOCS
2004
IEEE
15 years 10 months ago
An Approximate Max-Steiner-Tree-Packing Min-Steiner-Cut Theorem
Given an undirected multigraph G and a subset of vertices S V (G), the STEINER TREE PACKING problem is to find a largest collection of edge-disjoint trees that each connects S. T...
Lap Chi Lau
DAWAK
2006
Springer
15 years 10 months ago
Achieving k-Anonymity by Clustering in Attribute Hierarchical Structures
Abstract. Individual privacy will be at risk if a published data set is not properly de-identified. k-anonymity is a major technique to de-identify a data set. A more general view ...
Jiuyong Li, Raymond Chi-Wing Wong, Ada Wai-Chee Fu...
« Prev « First page 1267 / 1555 Last » Next »