2168 search results - page 158 / 434 » Using Approximation Hardness to Achieve Dependable Computati... |
158
click to vote
IM
2007
15 years 4 months ago
2007
A local graph partitioning algorithm finds a cut near a specified starting vertex, with a running time that depends largely on the size of the small side of the cut, rather than...
226
click to vote
VLDB
2007
ACM
16 years 4 months ago
2007
ACM
The growing nature of databases, and the flexibility inherent in the SQL query language that allows arbitrarily complex formulations, can result in queries that take inordinate am...
153
click to vote
SIAMJO
2000
15 years 3 months ago
2000
Mathematical programs with nonlinear complementarity constraints are reformulated using better-posed but nonsmooth constraints. We introduce a class of functions, parameterized by...
156
click to vote
ICPR
2008
IEEE
16 years 5 months ago
2008
IEEE
In kernel density estimation methods, an approximation of the data probability density function is achieved by locating a kernel function at each data location. The smoothness of ...
126
click to vote
ACL
2010
15 years 2 months ago
2010
In this paper, we address the task of mapping high-level instructions to sequences of commands in an external environment. Processing these instructions is challenging--they posit...