The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
Filters
Page 3916 of Mathematical Reviews Vol. , Issue 96g
[page]
1996
Mathematical Reviews
Preserved Fulltext
computation and bounded queries. ...
Arslanov (Kazan’)
96g:03075 03D30 03D15 03D20 03D25 68Q15
Kummer, Martin [Kummer, Martin Walter]
(D-KLRH-L; Karlsruhe) ;
Stephan, Frank (D-KLRH-L; Karlsruhe)
Recursion-theoretic properties of frequency ...
Adaptive Point Location in Planar Convex Subdivisions
2017
International journal of computational geometry and applications
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Given a query sequence of length m, the total running time is O(OPT + m log log n + n), where n is the number of vertices in S and OPT is the minimum time required by any linear decision tree for answering ...
Therefore, for m ≥ n, our running time is only worse than the best possible bound by O(log log n) per query, which is much smaller than the O(log n) query time offered by an worst-case optimal planar point ...
In any dimension, an information theoretic lower bound in processing a sequence of m queries follows from Shannon's work [26] and the entropy-based lower bound is z f (z)·log m f (z) , where f (z) denotes ...
doi:10.1142/s0218195917600019
fatcat:lvzdjx5bvjg23mnlvretxfgwde
New Algorithms for Performance Trace Analysis Based on Compressed Complete Call Graphs
[chapter]
2005
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
This paper addresses performance and scalability issues of state-of-the-art trace analysis. ...
Evaluation algorithms can be designed to take advantage of CCGs, too, such that the computational effort is reduced in the same order of magnitude as the memory requirements. ...
One of the two most important kinds of queries is the so called Summary Query. It computes a certain property for a given time interval and a given set of processes. ...
doi:10.1007/11428848_15
fatcat:bjuzfwkf7zcjpblm6izify73xy
Deriving predicate statistics in datalog
2010
Proceedings of the 12th international ACM SIGPLAN symposium on Principles and practice of declarative programming - PPDP '10
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2012; you can also visit the original URL.
The file type is application/pdf.
; 2) the estimates largely preserve the relative order of real query sizes and thus can be used to guide cost based query optimizers. ...
Base predicate statistics are computed and summarized using dependency matrices, and derived predicate statistics are computed by evaluating rules in an abstract way with rule bodies replaced with algebraic ...
Acknowledgments This work is part of the SILK (Semantic Inference on Large Knowledge) project sponsored by Vulcan, Inc. The authors were also partially supported by the NSF grant 0964196. ...
doi:10.1145/1836089.1836095
dblp:conf/ppdp/LiangK10
fatcat:2ydnpel26jhfxf24gioeb5fqnm
The LDL system prototype
1990
IEEE Transactions on Knowledge and Data Engineering
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2003; you can also visit the original URL.
The file type is application/pdf.
This paper contains a comprehensive overview of the system and contains a description of the LDL language and the compilation techniques employed to translate LDL queries into target queries on the stored ...
The paper further contains a description of the architecture and runtime environment of the system and the optimization techniques employed in order to improve the performance and assure the safety of ...
The reentrant property is especially useful if the predicate is in the scope of a recursive query that is being computed topdown. ...
doi:10.1109/69.50907
fatcat:7hdqgrvklzf4zb2lm6xkejdk4a
Minimum Probability of Error Image Retrieval
2004
IEEE Transactions on Signal Processing
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
The probability of retrieval error is lower-and upper-bounded by functions of the Bayes and density estimation errors, and the impact of the components of the retrieval architecture (namely, the feature ...
transformation and density estimation) on these bounds is characterized. ...
Furthermore, the contribution to , of a mixture component of mean and covariance can be computed recursively. Letting and , the recursion is as follows. ...
doi:10.1109/tsp.2004.831125
fatcat:2bmgag7qjjgynft2c3o7cl6v6y
Page 6058 of Mathematical Reviews Vol. , Issue 2002H
[page]
2002
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
Theoret. Comput. Sci. 268 (2001), no. 2, 367-393. ...
(English summary) Communication, molecular computing and randomized algorithms (Brno, 1998).
Theoret. Comput. Sci. 264 (2001), no. 1, 155-167. ...
Mining optimal decision trees from itemset lattices
2007
Proceedings of the 13th ACM SIGKDD international conference on Knowledge discovery and data mining - KDD '07
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Because the discovery of optimal trees has high theoretical complexity, until now no efforts have been made to compute such trees for real-world datasets. ...
An exact algorithm is of both scientific and practical interest. ...
Toivonen, and A. I. Verkamo. Fast discovery of association rules. In ...
doi:10.1145/1281192.1281250
dblp:conf/kdd/NijssenF07
fatcat:khoqmi3heje6tnmfxtnhmixama
Implementing Metric Operators of a Spatial Query Language for 3D Building Models: Octree and B-Rep Approaches
2009
Journal of computing in civil engineering
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
The octree allows for the application of recursive algorithms that successively increase the discrete resolution of the spatial objects employed and thereby enables the user to trade-off between computational ...
A Spatial Query Language for Building Information Models enables the spatial analysis of buildings and the extraction of partial models that fulfill certain spatial constraints. ...
In the theoretic setup we computed the distance between two spheres with radius 1, one located at (0,0,0) and the other one at (2,2,2). ...
doi:10.1061/(asce)0887-3801(2009)23:1(34)
fatcat:hpueaouxvrg43efsceetkm44ri
Linear and Range Counting under Metric-based Local Differential Privacy
[article]
2020
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Other Versions
., estimating means and item frequencies) under LDP have been well studied. ...
For analytical tasks such as range queries, however, the best known error bound is dependent on the domain size of private data, which is potentially prohibitive. ...
The computation of B −1 m,D can be done via the recursion in Equation (9). ...
arXiv:1909.11778v3
fatcat:cjbhtzoozrf6fbjjijreqg53v4
The pushdown method to optimize chain logic programs
[chapter]
1995
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2003; you can also visit the original URL.
The file type is application/pdf.
The critical problem of finding efficient implementations for recursive queries with bound arguments offers many open challenges of practical and theoretical import. ...
We propose a novel approach that solves this problem for chain queries, i.e., for queries where bindings are propagated from arguments in the head to arguments in the tail of the rules, in a chain-like ...
Besides to giving an efficient execution scheme to bound chain queries and providing an extension of the counting method, another nice property of the new method is that it introduces a unified framework ...
doi:10.1007/3-540-60084-1_102
fatcat:ysgy6tz66bfxpipp7f5bfxkude
Page 413 of Mathematical Reviews Vol. , Issue 91A
[page]
1991
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
Theoret. Comput. Sci. 68 (1989), no. 1, 1-17.
The authors obtain the variance of the external path length of
a symmetric binary Patricia tree. ...
413 68P Theory of data
given set of elements and their access frequencies, one can con- struct many B-trees (possibly with different heights). ...
Subject index volumes 1–200
1999
Theoretical Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Index Volumes I-2OO/Theoretical
Computer Science 213/214 (1999) 5-436
time and space complexity, 616, 624, 1155
classes, 773
time bound, 2162.2395
subexponential -, 2668
time bounded
automata, ...
, 1560
frequency, 2388
computation, 3090
of factors in the Fibonacci sequence, 3 165
Friedberg, theorem of -, 1398
Friedberg-Muchnik
theorem, 1398
Friedman and Greibach, 3681
friendly semantics ...
doi:10.1016/s0304-3975(98)00319-3
fatcat:s22ud3iiqjht7lfbtc3zctk7zm
Exact bound–bound Gaunt factor values for quantum levels up to n = 2000
2014
Monthly notices of the Royal Astronomical Society
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
Other Versions
Comparison of observations of radio recombination lines in the interstellar medium with theoretical models can be used to constrain electron temperature and density of the gas. ...
Detections of radio recombination lines with the new Low Frequency Array (LOFAR) has prompted an examination of theoretical models of the interstellar medium. ...
Here we revisit the calculation of the bound-bound Gaunt factor for quantum levels up to n = 2000, using arbitrary-precision operations to compute and tabulate exact values of the Gaunt factor for easy ...
doi:10.1093/mnras/stu775
fatcat:ylgw3jo3hrcjtduj2pwuzf5hg4
Page 1366 of Mathematical Reviews Vol. 56, Issue 4
[page]
1978
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
Téth, Algebra and logic in theoretical computer science (pp. 78-92); B. Kacewicz and H. Wozniakowski, A survey of recent problems and results in analytic computational com- plexity (pp. 93-107); H. ...
and complexity of algorithms, theoretical aspects of programming and of program- ming languages, theoretical aspects of operating systems and mathematical approaches to artificial intelligence.” ...
« Previous
Showing results 1 — 15 out of 8,175 results