4843 search results - page 230 / 969 » The Shortcut Problem - Complexity and Approximation |
146
click to vote
CORR
2007
Springer
15 years 3 months ago
2007
Springer
Orienteering is the following optimization problem: given an edge-weighted graph (directed or undirected), two nodes s, t and a time limit T, find an s-t walk of total length at ...
144
Voted
STACS
2007
Springer
15 years 9 months ago
2007
Springer
We consider the problem of computing an approximate minimum cycle basis of an undirected non-negative edge-weighted graph G with m edges and n vertices; the extension to directed ...
224
click to vote
ICDE
2006
IEEE
16 years 4 months ago
2006
IEEE
Peer-to-peer databases are becoming prevalent on the Internet for distribution and sharing of documents, applications, and other digital media. The problem of answering large scal...
127
Voted
ICML
2003
IEEE
16 years 4 months ago
2003
IEEE
When the goal is to achieve the best correct classification rate, cross entropy and mean squared error are typical cost functions used to optimize classifier performance. However,...
135
click to vote
STOC
2003
ACM
16 years 3 months ago
2003
ACM
In this paper, we show that any n point metric space can be embedded into a distribution over dominating tree metrics such that the expected stretch of any edge is O(log n). This ...