7150 search results - page 296 / 1430 » An Approximation Algorithm for Approximation Rank |
165
click to vote
STOC
2006
ACM
16 years 7 months ago
2006
ACM
Producing a small DNF expression consistent with given data is a classical problem in computer science that occurs in a number of forms and has numerous applications. We consider ...
166
Voted
ICCAD
2008
IEEE
16 years 3 months ago
2008
IEEE
Abstract— As VLSI technology enters the nanoscale regime, interconnect delay becomes the bottleneck of circuit performance. Compared to gate delays, wires are becoming increasing...
177
click to vote
KDD
2000
ACM
15 years 10 months ago
2000
ACM
Information extraction is one of the most important techniques used in Text Mining. One of the main problems in building information extraction (IE) systems is that the knowledge ...
207
click to vote
ICALP
2011
Springer
14 years 10 months ago
2011
Springer
We present an O( √ n log n)-approximation algorithm for the problem of finding the sparsest spanner of a given directed graph G on n vertices. A spanner of a graph is a sparse ...
177
click to vote
MP
2002
15 years 6 months ago
2002
UOBYQA is a new algorithm for general unconstrained optimization calculations, that takes account of the curvature of the objective function, F say, by forming quadratic models by ...