3874 search results - page 315 / 775 » Approximation Algorithms for k-hurdle Problems |
141
Voted
JOIN
2007
15 years 4 months ago
2007
This paper is devoted to the following incremental problem. Initially, a graph and a distinguished subset of vertices, called initial group, are given. This group is connected by ...
135
Voted
SWAT
1994
Springer
15 years 9 months ago
1994
Springer
We give linear-time algorithms for a class of parametric search problems on weighted graphs of bounded tree-width. We also discuss the implications of our results to approximate p...
99
Voted
ACL
2004
15 years 6 months ago
2004
We present the first algorithm that computes optimal orderings of sentences into a locally coherent discourse. The algorithm runs very efficiently on a variety of coherence measur...
129
click to vote
ESANN
2007
15 years 6 months ago
2007
Abstract. The convex optimisation problem involved in fitting a kernel probit regression (KPR) model can be solved efficiently via an iteratively re-weighted least-squares (IRWLS)...
147
click to vote
COCO
2006
Springer
15 years 8 months ago
2006
Springer
We consider a general approach to the hoary problem of (im)proving circuit lower bounds. We define notions of hardness condensing and hardness extraction, in analogy to the corres...