1632 search results - page 63 / 327 » Sublinear Time Algorithms for Metric Space Problems |
107
click to vote
CPM
2003
Springer
15 years 8 months ago
2003
Springer
Given n fragments from k > 2 genomes, we will show how to find an optimal chain of colinear non-overlapping fragments in time O(n logk−2 n log log n) and space O(n logk−2 n...
130
click to vote
COMPGEOM
2006
ACM
15 years 9 months ago
2006
ACM
We study the problem of minimum-distortion embedding of ultrametrics into the plane and higher dimensional spaces. Ultrametrics are a natural class of metrics that frequently occu...
137
click to vote
ICCAD
2008
IEEE
16 years 11 days ago
2008
IEEE
Abstract— Process variations make at-speed testing significantly more difficult. They cause subtle delay changes that are distributed rather than the localized nature of a trad...
188
Voted
INFOCOM
2011
IEEE
14 years 6 months ago
2011
IEEE
Abstract—We propose a routing metric for enabling highthroughput reliable multicast in multi-rate wireless mesh networks. This new multicast routing metric, called expected multi...
142
Voted
COLT
2005
Springer
15 years 5 months ago
2005
Springer
External regret compares the performance of an online algorithm, selecting among N actions, to the performance of the best of those actions in hindsight. Internal regret compares ...