7930 search results - page 1104 / 1586 » Greedy in Approximation Algorithms |
184
click to vote
ICML
2006
IEEE
16 years 7 months ago
2006
IEEE
Recently, a very appealing approach was proposed to compute the entire solution path for support vector classification (SVC) with very low extra computational cost. This approach ...
201
click to vote
KDD
2008
ACM
16 years 7 months ago
2008
ACM
Current research in indexing and mining time series data has produced many interesting algorithms and representations. However, it has not led to algorithms that can scale to the ...
193
click to vote
RECOMB
2005
Springer
16 years 7 months ago
2005
Springer
Abstract. In this paper, we study lower bound techniques for branchand-bound algorithms for maximum parsimony, with a focus on gene order data. We give a simple O(n3 ) time dynamic...
174
click to vote
STOC
2002
ACM
16 years 7 months ago
2002
ACM
Cooper, Dyer and Frieze studied the problem of sampling H-colourings (nearly) uniformly at random. Special cases of this problem include sampling colourings and independent sets a...
176
click to vote
STOC
2001
ACM
16 years 7 months ago
2001
ACM
We show that we can maintain up to polylogarithmic edge connectivity for a fully-dynamic graph in ~O(pn) time per edge insertion or deletion. Within logarithmic factors, this matc...