983 search results - page 117 / 197 » Continuous Queries in Oracle |
JMLR
2002
14 years 9 months ago
2002
We construct a framework which allows an algorithm to turn the distributions produced by some boosting algorithms into polynomially smooth distributions (w.r.t. the PAC oracle...
SIAMCOMP
2010
14 years 4 months ago
2010
Hardness amplification is the fundamental task of converting a -hard function f : {0, 1}n {0, 1} into a (1/2 - )-hard function Amp(f), where f is -hard if small circuits fail to c...
111
click to vote
CVPR
2012
IEEE
13 years 11 days ago
2012
IEEE
Watershed cuts are among the fastest segmentation algorithms and therefore well suited for interactive segmentation of very large 3D data sets. To minimize the number of user inte...
176
click to vote
ICDE
2007
IEEE
15 years 11 months ago
2007
IEEE
The content-based publish/subscribe (pub/sub) paradigm for system design is becoming increasingly popular, offering unique benefits for a large number of data-intensive applicatio...
FCT
1995
Springer
15 years 1 months ago
1995
Springer
Abstract. We present algorithms for maintaining shortest path information in dynamic outerplanar digraphs with sublogarithmic query time. By choosing appropriate parameters we achi...