7150 search results - page 1106 / 1430 » An Approximation Algorithm for Approximation Rank |
205
click to vote
FOCS
2008
IEEE
16 years 1 months ago
2008
IEEE
We prove that approximating the Max Acyclic Subgraph problem within a factor better than 1/2 is Unique-Games hard. Specifically, for every constant ε > 0 the following holds:...
242
click to vote
SSD
2007
Springer
16 years 23 days ago
2007
Springer
In the k-medoid problem, given a dataset P, we are asked to choose k points in P as the medoids. The optimal medoid set minimizes the average Euclidean distance between the points ...
223
click to vote
SI3D
1999
ACM
15 years 11 months ago
1999
ACM
In the real world designers often use French curves or sweeps to create or edit curves to bring out a personal style or reflect a corporate standard in all their designs. A Frenc...
160
click to vote
LWA
2007
15 years 8 months ago
2007
This paper describes the application of machine learning methods to determine parameters for DeLite, a readability checking tool. DeLite pinpoints text segments that are difficul...
221
click to vote
MMAS
2011
Springer
15 years 1 months ago
2011
Springer
While existing mathematical descriptions can accurately account for phenomena at microscopic scales (e.g. molecular dynamics), these are often high-dimensional, stochastic and thei...