1091 search results - page 136 / 219 » Approximation Algorithms for Data Placement Problems |
WWW
2005
ACM
14 years 8 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...
PKDD
2009
Springer
14 years 2 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...
IRI
2006
IEEE
14 years 2 months ago
2006
IEEE
— Maximal full rectangles in tabular data are useful in several areas of data engineering. This paper presents a survey of results in which we replace “full rectangles” by ...
ASPDAC
2007
ACM
14 years 5 hour ago
2007
ACM
In the paper, we develop a systematic methodology for modeling sampled interconnect frequency response data based on spline interpolation. Through piecewise polynomial interpolatio...
ML
2008
ACM
13 years 8 months ago
2008
ACM
Abstract. We consider batch reinforcement learning problems in continuous space, expected total discounted-reward Markovian Decision Problems. As opposed to previous theoretical wo...