2740 search results - page 89 / 548 » Approximating Component Selection |
STOC
2009
ACM
15 years 10 months ago
2009
ACM
The low-rank matrix approximation problem involves finding of a rank k version of a m ? n matrix AAA, labeled AAAk, such that AAAk is as "close" as possible to the best ...
SODA
1997
ACM
14 years 11 months ago
1997
ACM
We study graph partitioning problems on graphs with edge capacities and vertex weights. The problems of b-balanced cuts and k-balanced partitions are unified into a new problem ca...
AAAI
1992
14 years 11 months ago
1992
models require the identi cation of abstractions and approximations that are well suited to the task at hand. In this paper we analyze the problem of automatically selecting adequ...
ASPLOS
2012
ACM
13 years 5 months ago
2012
ACM
Disciplined approximate programming lets programmers declare which parts of a program can be computed approximately and consequently at a lower energy cost. The compiler proves st...
RSFDGRC
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. We introduce a hybrid approach to magnetic resonance image segmentation using unsupervised clustering and the rules derived from approximate decision reducts. We utilize ...