5595 search results - page 302 / 1119 » Approximation Algorithms for Clustering Problems |
151
click to vote
APPML
2002
15 years 6 months ago
2002
A method for structural clustering is proposed involving data on subset-to-entity linkages that can be calculated with structural data such as graphs or sequences or images. The m...
181
Voted
AAAI
2007
15 years 9 months ago
2007
Partially Observable Markov Decision Processes (POMDPs) provide an appropriately rich model for agents operating under partial knowledge of the environment. Since finding an opti...
184
Voted
CALC
2001
Springer
15 years 11 months ago
2001
Springer
We show that recent results of Coppersmith, Boneh, Durfee and Howgrave-Graham actually apply in the more general setting of (partially) approximate common divisors. This leads us t...
181
click to vote
ICDM
2009
IEEE
16 years 1 months ago
2009
IEEE
—Time series motifs are sets of very similar subsequences of a long time series. They are of interest in their own right, and are also used as inputs in several higher-level data...
168
click to vote
CISS
2008
IEEE
16 years 1 months ago
2008
IEEE
Abstract—We develop neurally plausible local competitive algorithms (LCAs) for reconstructing compressively sensed images. Reconstruction requires solving a sparse approximation ...