1091 search results - page 76 / 219 » Approximation Algorithms for Data Placement Problems |
143
click to vote
TNN
2010
14 years 9 months ago
2010
Abstract--Recently, sparse approximation has become a preferred method for learning large scale kernel machines. This technique attempts to represent the solution with only a subse...
273
click to vote
KDD
2012
ACM
13 years 4 months ago
2012
ACM
Display ads on the Internet are often sold in bundles of thousands or millions of impressions over a particular time period, typically weeks or months. Ad serving systems that ass...
124
click to vote
SIAMSC
2008
15 years 2 months ago
2008
In this study, nonnegative matrix factorization is recast as the problem of approximating a polytope on the probability simplex by another polytope with fewer facets. Working on th...
119
click to vote
NIPS
2004
15 years 3 months ago
2004
We study the problem of hierarchical classification when labels corresponding to partial and/or multiple paths in the underlying taxonomy are allowed. We introduce a new hierarchi...
119
Voted
INFOCOM
2007
IEEE
15 years 8 months ago
2007
IEEE
— The forthcoming 4G cellular systems will provide broadband wireless access to a variety of advanced data and voice services. In order to do that, these networks will have a sig...