5595 search results - page 359 / 1119 » Approximation Algorithms for Clustering Problems |
168
click to vote
KDD
2007
ACM
16 years 7 months ago
2007
ACM
Time series motifs are approximately repeated patterns found within the data. Such motifs have utility for many data mining algorithms, including rule-discovery, novelty-detection...
294
click to vote
SIGMOD
2009
ACM
16 years 7 months ago
2009
ACM
An approximate search query on a collection of strings finds those strings in the collection that are similar to a given query string, where similarity is defined using a given si...
199
click to vote
ICALP
2010
Springer
15 years 11 months ago
2010
Springer
The general problem of robust optimization is this: one of several possible scenarios will appear tomorrow, but things are more expensive tomorrow than they are today. What should...
196
click to vote
ISPAN
2005
IEEE
16 years 10 days ago
2005
IEEE
An important requirement for the effective scheduling of parallel applications on large heterogeneous clusters is a current view of system resource availability. Maintaining such ...
178
click to vote
NIPS
2007
15 years 8 months ago
2007
Clustering is often formulated as a discrete optimization problem. The objective is to find, among all partitions of the data set, the best one according to some quality measure....