Sciweavers

574 search results - page 89 / 115
» Approximation Algorithms for Free-Label Maximization
Sort
View
PKDD
2009
Springer
147views Data Mining» more  PKDD 2009»
14 years 3 months ago
Kernel Polytope Faces Pursuit
Abstract. Polytope Faces Pursuit (PFP) is a greedy algorithm that approximates the sparse solutions recovered by 1 regularised least-squares (Lasso) [4,10] in a similar vein to (Or...
Tom Diethe, Zakria Hussain
DAWAK
2007
Springer
14 years 2 months ago
MOSAIC: A Proximity Graph Approach for Agglomerative Clustering
Representative-based clustering algorithms are quite popular due to their relative high speed and because of their sound theoretical foundation. On the other hand, the clusters the...
Jiyeon Choo, Rachsuda Jiamthapthaksin, Chun-Sheng ...
LICS
2006
IEEE
14 years 2 months ago
Managing Digital Rights using Linear Logic
Digital music players protect songs by enforcing licenses that convey specific rights for individual songs or groups of songs. For licenses specified in industry, we show that d...
Adam Barth, John C. Mitchell
ICPP
2002
IEEE
14 years 1 months ago
Optimal Video Replication and Placement on a Cluster of Video-on-Demand Servers
A cost-effective approach to building up scalable Videoon-Demand (VoD) servers is to couple a number of VoD servers together in a cluster. In this article, we study a crucial vide...
Xiaobo Zhou, Cheng-Zhong Xu
SIGMOD
2008
ACM
111views Database» more  SIGMOD 2008»
14 years 8 months ago
Discovering bucket orders from full rankings
Discovering a bucket order B from a collection of possibly noisy full rankings is a fundamental problem that relates to various applications involving rankings. Informally, a buck...
Jianlin Feng, Qiong Fang, Wilfred Ng