18306 search results - page 360 / 3662 » Algorithmics in Exponential Time |
143
click to vote
STOC
2009
ACM
16 years 7 months ago
2009
ACM
We describe a new approximation algorithm for Max Cut. Our algorithm runs in ~O(n2 ) time, where n is the number
205
click to vote
SIAMMA
2011
14 years 9 months ago
2011
The reduced basis method was introduced for the accurate online evaluation of solutions to a parameter dependent family of elliptic partial differential equations. ly, it can be ...
199
click to vote
KDD
2010
ACM
15 years 10 months ago
2010
ACM
The detection of repeated subsequences, time series motifs, is a problem which has been shown to have great utility for several higher-level data mining algorithms, including clas...
223
click to vote
ICALP
2001
Springer
15 years 11 months ago
2001
Springer
We present a probabilistic algorithm that, given a connected graph G (represented by adjacency lists) of average degree d, with edge weights in the set {1, . . . , w}, and given a ...
180
click to vote
ICML
2008
IEEE
16 years 7 months ago
2008
IEEE
We present a principled Bayesian framework for modeling partial memberships of data points to clusters. Unlike a standard mixture model which assumes that each data point belongs ...