478 search results - page 28 / 96 » Improving probability bounds by optimization over subsets |
STOC
2002
ACM
14 years 7 months ago
2002
ACM
We present improved algorithms for maintaining transitive closure and all-pairs shortest paths/distances in a digraph under deletion of edges. For the problem of transitive closur...
NIPS
2003
13 years 9 months ago
2003
There exist many different generalization error bounds for classification. Each of these bounds contains an improvement over the others for certain situations. Our goal is to com...
SIGMETRICS
2008
ACM
13 years 7 months ago
2008
ACM
Dynamic networks are those where the topology changes over time and therefore efficient routes need to be maintained by frequent updates. Such updates could be costly in terms of ...
WWW
2007
ACM
14 years 8 months ago
2007
ACM
Search queries applied to extract relevant information from the World Wide Web over a period of time may be denoted as continuous search queries. The improvement of continuous sea...
CC
2011
Springer
12 years 11 months ago
2011
Springer
For decades, the design and implementation of arrays in programming languages has reflected a natural tension between productivity and performance. Recently introduced HPCS langua...