4843 search results - page 459 / 969 » The Shortcut Problem - Complexity and Approximation |
163
click to vote
PLDI
2010
ACM
15 years 10 months ago
2010
ACM
We present smooth interpretation, a method to systematically approximate numerical imperative programs by smooth mathematical functions. This approximation facilitates the use of ...
151
click to vote
ICALP
2010
Springer
15 years 10 months ago
2010
Springer
Computing a minimum vertex cover in graphs and hypergraphs is a well-studied optimizaton problem. While intractable in general, it is well known that on bipartite graphs, vertex c...
151
click to vote
INFOCOM
2000
IEEE
15 years 9 months ago
2000
IEEE
Abstract—We study a network model in which each network link is associated with a set of delays and costs. These costs are a function of the delays and reflect the prices paid i...
165
click to vote
BTW
2007
Springer
15 years 9 months ago
2007
Springer
: The reverse k-nearest neighbor (RkNN) problem, i.e. finding all objects in a data set the k-nearest neighbors of which include a specified query object, has received increasing a...
187
click to vote
FOCS
2010
IEEE
15 years 3 months ago
2010
IEEE
We consider k-median clustering in finite metric spaces and k-means clustering in Euclidean spaces, in the setting where k is part of the input (not a constant). For the k-means pr...