3875 search results - page 521 / 775 » Approximation algorithms for the 0-extension problem |
173
click to vote
CVPR
2007
IEEE
16 years 8 months ago
2007
IEEE
The success of tensor-based subspace learning depends heavily on reducing correlations along the column vectors of the mode-k flattened matrix. In this work, we study the problem ...
186
click to vote
WWW
2005
ACM
16 years 7 months ago
2005
ACM
Web pages contain a combination of unique content and template material, which is present across multiple pages and used primarily for formatting, navigation, and branding. We stu...
173
Voted
PKDD
2009
Springer
16 years 1 months ago
2009
Springer
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...
153
click to vote
ICDCS
2007
IEEE
16 years 28 days ago
2007
IEEE
Peer to peer (P2P) systems are moving from application specific architectures to a generic service oriented design philosophy. This raises interesting problems in connection with...
184
click to vote
ICPP
2002
IEEE
15 years 11 months ago
2002
IEEE
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...