123,269 Hits in 9.2 sec

Marked Ancestor Problems (Preliminary Version)

Stephen Alstrup, Thore Husfeldt, Theis Rauhe
1998 BRICS Report Series  
Given a node, we want to find its nearest marked ancestor. This generalises the well-known predecessor problem, where the tree is a path.<br /> We show tight upper and lower bounds for this problem.  ...  The lower bounds are proved in the cell probe model, the upper bounds run on a unit-cost RAM.<br /> As easy corollaries we prove (often optimal) lower bounds on a number of problems.  ...  The proofs for our lower bounds use an information theoretic argument in which it is necessary to limit the number of memory registers that can be accessed by the algorithm.  ... 
doi:10.7146/brics.v5i7.19279 fatcat:5pkc3trj6ncrhad4urtk7skuyu

AGM-Style Revision of Beliefs and Intentions from a Database Perspective (Preliminary Version) [article]

Marc van Zee, Dragan Doder
2016 arXiv   pre-print
We introduce a logic for temporal beliefs and intentions based on Shoham's database perspective. We separate strong beliefs from weak beliefs.  ...  We formalize coherence conditions on strong beliefs and intentions. We provide AGM-style postulates for the revision of strong beliefs and intentions.  ...  Conclusion We develop a logical theory for reasoning about temporal beliefs and intentions based on Shoham's database perspective.  ... 
arXiv:1604.07183v2 fatcat:mhwimzvvr5hpbeztnf2u3jtr5a

Distributed match-making for processes in computer networks (preliminary version)

Sape J. Mullender, Paul M. B. Vitányi
1985 Proceedings of the fourth annual ACM symposium on Principles of distributed computing - PODC '85  
In the very large multiprocessor systems and, on a gander scale, computer networks now emerging, processes are not tied to fixed processors but run on processors taken from a pool of processors.  ...  The theoretical limitations of distributed matchmaking are established, and the techniques are applied to several network topologies. 261  ...  Each pair of lines has exactly one point in common. A server s posts its (port, address) to all nodes on an arbitrary line incident on its host node.  ... 
doi:10.1145/323596.323620 dblp:conf/podc/MullenderV85 fatcat:tgzc33d4vndxpbf4skl6obaxvy

Approximate range searching☆☆A preliminary version of this paper appeared in the Proc. of the 11th Annual ACM Symp. on Computational Geometry, 1995, pp. 172–181

Sunil Arya, David M. Mount
2000 Computational geometry  
For convex ranges, we tighten this to O(log n + (1/ε) d−1 ) time.  ...  Most research has focused on solving this problem exactly, but lower bounds show that if linear space is assumed, the problem cannot be solved in polylogarithmic time, except for the case of orthogonal  ...  Our running times are given assuming each of these can be computed in constant time. (In general, it is the product of the maximum time for each primitive and our time bounds.)  ... 
doi:10.1016/s0925-7721(00)00022-5 fatcat:3xpjepzszza5le7i3zpa3eypby

Chromatic nearest neighbor searching: A query sensitive approach☆☆A preliminary version of this paper appeared in the Proceedings of the 7th Canadian Conference on Computational Geometry, 1995, pp. 261–266

David M. Mount, Nathan S. Netanyahu, Ruth Silverman, Angela Y. Wu
2000 Computational geometry  
We also allow the user to specify an error bound ε 0, and consider the same problem in the context of approximate nearest neighbor searching.  ...  We present empirical evidence that for well clustered data sets, this approach leads to significant improvements in efficiency.  ...  We would also like to thank Sunil Arya for his helpful insights on the analysis of the branch-and-bound search.  ... 
doi:10.1016/s0925-7721(00)00021-3 fatcat:jokacr6x6rfcdmiwjps6kfyyye

Efficient randomized algorithms for robust estimation of circular arcs and aligned ellipses☆☆A preliminary version of this report was presented at the Fifth Canadian Conference on Computational Geometry [32]

David M. Mount, Nathan S. Netanyahu
2001 Computational geometry  
We present randomized algorithms for these estimators, whose expected running times are O(n 2 log n) for the circular case and O(n 3 log n) for the elliptical case.  ...  ., circular and elliptical arcs) to a finite collection of points in the plane is an important problem in statistical estimation and has significant industrial applications.  ...  Also, we are grateful to Azriel Rosenfeld for his comments, and Kathy Bumpass for her help in preparing this paper.  ... 
doi:10.1016/s0925-7721(01)00009-8 fatcat:2zu335ecerg57fagk7gnzwjwee

Preliminary Psychometric Properties of the Chinese Version of the Chronic Pain Coping Inventory (ChCPCI) in a Hong Kong Chinese Population

Wing S. Wong, Mark P. Jensen, Kan H. Mak, Barry K.H. Tam, Richard Fielding
2010 Journal of Pain  
In addition to ChCPCI-42, the patients were assessed on the Chronic Pain Grade (CPG), the Pain Catastrophizing Scale (PCS), the Centre for Epidemiological Studies ---depression Scale (CES-D), and socio-demographic  ...  These findings offered support for the factorial validity and reliability of CPCI to be used among Chinese chronic pain patients. (word count: 222)  ...  An alternative explanation is that these coping strategies contain a culture-bound element.  ... 
doi:10.1016/j.jpain.2009.10.008 pmid:20015705 fatcat:qbxt4vtmzvbxbd7gc6mj4bqbgq

APPLICATION OF THEOREM PROVING TO PROBLEM SOLVING**This research is a part of Project Defender and was supported by the Advanced Research Projects Agency of the Department of Defense and was monitored by Rome Air Development Center under Contracts AF 30(602)-4147 and F30602-69-C-0056.††This preprint is a preliminary version and is subject to modification prior to publication [chapter]

Cordell Green
1981 Readings in Artificial Intelligence  
The paper exhibits solutions to these problems obtained by QA3, a computer program bused on these theorem-proving methods.  ...  In addition, the paper shows how QA3 can write simple computer programs and can solve practical problems for a simple robot.  ...  Acknowledgment I would like to acknowledge valuable discussions with Dr. Bertram Raphael and Mr. Robert Yates.  ... 
doi:10.1016/b978-0-934613-03-3.50019-2 fatcat:zeeg6mjnurblvjrpty3yqljzoe

Page 7312 of Mathematical Reviews Vol. , Issue 90M [page]

1990 Mathematical Reviews  
Summary: “We use a graph-theoretic approach to derive asymp- totically optimal algorithms for parallel LU decomposition with partial pivoting on an MIMD computer.  ...  Vitanyi, A new approach to formal lan- guage theory by Kolmogorov complexity (preliminary version) (pp. 506-520); G. Louchard, B. Randrianarimanana and R. Schott, Dy- namic algorithms in D. E.  ... 

Page 4231 of Mathematical Reviews Vol. , Issue 81J [page]

1981 Mathematical Reviews  
Seiferas and Janos Simon, An information-theoretic approach to time bounds for on-line compu- tation (preliminary version) (pp. 357-367). Session VI: Richard M.  ...  Storer, The node cost measure for embedding graphs on the planar grid COMPUTER SCIENCE (including AUTOMATA) 81):68007 (extended abstract) (pp. 201-210); Allen Cypher, An approach to the k paths problem  ... 

Page 5224 of Mathematical Reviews Vol. , Issue 2002G [page]

2002 Mathematical Reviews  
Theoret. Comput.  ...  By applying our algorithm for merging evolutionary trees we obtain an O(dnlogn)-time bound on the problem of constructing an evolutionary tree for n species and maximum degree d from experiments.  ... 

A New Detailed Term Accounting Opacity Code: TOPAZ

C. A. Iglesias
2004 AIP Conference Proceedings  
However, statistical approaches have been shown to be inadequate for astrophysical opacity calculations. An application of the TOPAZ code will be to study the limits of statistical methods.  ...  At present, opacity calculations of heavier elements use statistical methods that rely on the presence of myriad spectral lines for accuracy.  ...  One possible explanation for the discrepancy may be an incorrect theoretical treatment of the spectral line widths.  ... 
doi:10.1063/1.1824867 fatcat:w7dpc3axxfc5rhzy4tzmtszazm

Parallelised Bayesian Optimisation via Thompson Sampling

Kirthevasan Kandasamy, Akshay Krishnamurthy, Jeff Schneider, Barnabás Póczos
2018 International Conference on Artificial Intelligence and Statistics  
sequential versions.  ...  In addition to these, the proposed procedure is conceptually much simpler than existing work for parallel BO.  ...  In line 3 we wait for all M workers to finish and compute the GP posterior with all M evaluations in lines 4-5.  ... 
dblp:conf/aistats/KandasamyKSP18 fatcat:m4hlrb7ksrcpnkxpgoiexknfym

Tuning pipelined scientific data analyses for efficient multicore execution

Andre Pereira, Antonio Onofre, Alberto Proenca
2016 2016 International Conference on High Performance Computing & Simulation (HPCS)  
Preliminary results show an impressive performance improvement of the pipeline tuning when compared to the original sequential HEP code (up to a 35x speedup in a dual 12-core system), and also show significant  ...  performance speedups over conventional parallelization approaches of this case study application (up to 10x faster in the same system).  ...  Three versions of ttH were selected: a configuration used for fast preliminary event analysis, ttH_as (assuming accurate sensors), with a memory-bound behaviour; a configuration oriented to perform a more  ... 
doi:10.1109/hpcsim.2016.7568410 dblp:conf/ieeehpcs/PereiraOP16 fatcat:k75wmlyoovbsvmyhoaxtwu3jkq

Data-driven filtering for linear systems using Set Membership multistep predictors [article]

Marco Lauricella, Lorenzo Fagiano
2020 arXiv   pre-print
This paper presents a novel data-driven, direct filtering approach for unknown linear time-invariant systems affected by unknown-but-bounded measurement noise.  ...  A modified filtering approach with lower online computational cost is also presented, obtained by moving the solution of the optimization problems to an offline preliminary phase, at the cost of larger  ...  Table II shows a brief comparison of the computational time required by the local and global approaches to provide the filtered version of one output sample.  ... 
arXiv:2008.11994v1 fatcat:owllvw7izvc2jaldln2iemoypu
« Previous Showing results 1 — 15 out of 123,269 results