5595 search results - page 430 / 1119 » Approximation Algorithms for Clustering Problems |
180
click to vote
IDA
2002
Springer
15 years 6 months ago
2002
Springer
Feature subset selection is important not only for the insight gained from determining relevant modeling variables but also for the improved understandability, scalability, and pos...
189
click to vote
DATE
2009
IEEE
16 years 1 months ago
2009
IEEE
—Scheduling task graphs under hard (end-to-end) timing constraints is an extensively studied NP-hard problem of critical importance for predictable software mapping on Multiproce...
170
click to vote
SIGECOM
2005
ACM
16 years 12 days ago
2005
ACM
In this paper we formulate the fixed budget resource allocation game to understand the performance of a distributed marketbased resource allocation system. Multiple users decide ...
179
click to vote
APPROX
2004
Springer
15 years 10 months ago
2004
Springer
Abstract. We address the problems of pattern matching and approximate pattern matching in the sketching model. We show that it is impossible to compress the text into a small sketc...
177
click to vote
ANOR
2002
15 years 6 months ago
2002
A new algorithm for solving smooth large-scale minimization problems with bound constraints is introduced. The way of dealing with active constraints is similar to the one used in...