7129 search results - page 384 / 1426 » Approximation Algorithms for Treewidth |
123
click to vote
PAKDD
2005
ACM
15 years 10 months ago
2005
ACM
In many modern application ranges high-dimensional feature vectors are used to model complex real-world objects. Often these objects reside on different local sites. In this paper,...
173
Voted
AUTOMATICA
2008
15 years 5 months ago
2008
Fitting data by a bounded complexity linear model is equivalent to low-rank approximation of a matrix constructed from the data. The data matrix being Hankel structured is equival...
138
click to vote
JMM2
2007
15 years 4 months ago
2007
—This paper aims to develop a novel framework to systematically trade-off computational complexity with output distortion in linear multimedia transforms, in an optimal manner. T...
215
click to vote
VLDB
2001
ACM
16 years 5 months ago
2001
ACM
Approximate query processing has emerged as a costeffective approach for dealing with the huge data volumes and stringent response-time requirements of today's decision-suppo...
171
click to vote
SIGECOM
2009
ACM
15 years 11 months ago
2009
ACM
The literature on algorithmic mechanism design is mostly concerned with game-theoretic versions of optimization problems to which standard economic money-based mechanisms cannot b...