7006 search results - page 1264 / 1402 » Approximation Algorithms |
136
click to vote
STRINGOLOGY
2004
15 years 6 months ago
2004
We investigate the shortest common superstring problem (SCSSP). As SCSSP is APX-complete it cannot be approximated within an arbitrarily small performance ratio. One heuristic tha...
171
click to vote
WOB
2004
15 years 6 months ago
2004
ABSTRACT. Reconfigurable systolic arrays can be adapted to efficiently resolve a wide spectrum of computational problems; parallelism is naturally explored in systolic arrays and r...
121
click to vote
NIPS
2003
15 years 6 months ago
2003
Clustering aims at extracting hidden structure in dataset. While the problem of finding compact clusters has been widely studied in the literature, extracting arbitrarily formed ...
141
click to vote
SDM
2003
SIAM
15 years 6 months ago
2003
SIAM
We study the interaction between global and local techniques in data mining. Specifically, we study the collections of frequent sets in clusters produced by a probabilistic clust...
137
click to vote
AAAI
1998
15 years 6 months ago
1998
A central problem in learning in complex environmentsis balancing exploration of untested actions against exploitation of actions that are known to be good. The benefit of explora...