5169 search results - page 131 / 1034 » Locality approximation using time |
129
click to vote
CORR
2010
Springer
15 years 5 months ago
2010
Springer
We introduce a new approach to computing an approximately maximum s-t flow in a capacitated, undirected graph. This flow is computed by solving a sequence of electrical flow probl...
151
click to vote
CDC
2010
IEEE
14 years 12 months ago
2010
IEEE
Approximate policy iteration methods based on temporal differences are popular in practice, and have been tested extensively, dating to the early nineties, but the associated conve...
137
click to vote
FOCS
1999
IEEE
15 years 9 months ago
1999
IEEE
We show that the minimum distance of a linear code is not approximable to within any constant factor in random polynomial time (RP), unless nondeterministic polynomial time (NP) eq...
129
click to vote
ICALP
2010
Springer
15 years 9 months ago
2010
Springer
The mode of a multiset of labels, is a label that occurs at least as often as any other label. The input to the range mode problem is an array A of size n. A range query [i, j] mus...
150
click to vote
VLDB
2000
ACM
15 years 8 months ago
2000
ACM
Approximate query answering systems provide very fast alternatives to OLAP systems when applications are tolerant to small errors in query answers. Current sampling-based approach...