4843 search results - page 234 / 969 » The Shortcut Problem - Complexity and Approximation |
131
Voted
COMPGEOM
2007
ACM
15 years 7 months ago
2007
ACM
The paper consists of two major parts. In the first part, we re-examine relative -approximations, previously studied in [12, 13, 18, 25], and their relation to certain geometric p...
123
Voted
CVPR
2006
IEEE
16 years 5 months ago
2006
IEEE
Recently four non-iterative algorithms for simultaneous low rank approximations of matrices (SLRAM) have been presented by several researchers. In this paper, we show that those a...
109
Voted
STACS
2005
Springer
15 years 9 months ago
2005
Springer
Abstract. We consider data structures and algorithms for preprocessing a labelled list of length n so that, for any given indices i and j we can answer queries of the form: What is...
128
Voted
INFOCOM
2000
IEEE
15 years 8 months ago
2000
IEEE
Abstract—We investigate the problem of providing a fair bandwidth allocation to each of flows that share the outgoing link of a congested router. The buffer at the outgoing link...
121
click to vote
AMAST
2006
Springer
15 years 7 months ago
2006
Springer
The problem of finding an approximation to a labeled Markov transition system through hyperfinite transition systems is addressed. It is shown that we can find for each countable ...