Filters








9,216 Hits in 4.4 sec

On the Evaluation of Indexing Techniques for Theorem Proving [chapter]

Robert Nieuwenhuis, Thomas Hillenbrand, Alexandre Riazanov, Andrei Voronkov
2001 Lecture Notes in Computer Science  
Here the overall results of Waldmeister were considered enough to conclude that it implements the best indexing techniques.  ...  Partially supported by the Spanish CICYT project HEMOSS ref. TIC98-0949-C02-01.  ...  Acknowledgments We thank Jürgen Avenhaus for valuable remarks to yesterday's version of this paper which was as a result substantially rewritten today.  ... 
doi:10.1007/3-540-45744-5_19 fatcat:k3kprxozzffb5nwh32vtnf2hcy

Page 4551 of Mathematical Reviews Vol. , Issue 93h [page]

1993 Mathematical Reviews  
We describe an efficient implementation of the Davis-Putnam- Loveland algorithm for checking the satisfiability of the original set.  ...  The four retrieval operations of concern are to find variants, generalization, instances, and terms that unify with a given term.  ... 

Fingerprint Indexing for Paramodulation and Rewriting [chapter]

Stephan Schulz
2012 Lecture Notes in Computer Science  
Indexing is critical for the performance of automated firstorder theorem provers.  ...  Fingerprint indexing supports both matching and unification as retrieval relations. The algorithms are simple, the indices are small, and performance is very good in practice.  ...  Acknowledgements: I thank the University of Miami's Center for Computational Science HPC team for making their cluster available for the experimental evaluation.  ... 
doi:10.1007/978-3-642-31365-3_37 fatcat:sqml7r7xkrb5fk5lxjhajfkojq

Extended path-indexing [chapter]

Peter Graf
1994 Lecture Notes in Computer Science  
The performance of a theorem prover crucially depends on the speed of the basic retrieval operations, such as finding terms that are unifiable with (instances of, or more general than) some query term.  ...  We present an improved version of Path-Indexing that provides both the query trees and the Path-Index with indirect clash and occur-check information.  ...  Acknowledgements Thanks to Leo Bachmair, Hans Jürgen Ohlbach, and David Plaisted for their comments on earlier versions of this paper. We also like to thank William McCune for providing the term sets.  ... 
doi:10.1007/3-540-58156-1_37 fatcat:tarqslblojedlbioqgeflzyoru

Fast and Scalable Image Retrieval Using Predictive Clustering Trees [chapter]

Ivica Dimitrovski, Dragi Kocev, Suzana Loskovska, Sašo Džeroski
2013 Lecture Notes in Computer Science  
Stateof-the-art systems for image retrieval use the bag-of-visual-words representation of the images.  ...  The results reveal that the proposed method produces a visual vocabulary with superior discriminative power and thus better retrieval performance.  ...  The value of the information obtained from an image depends on how easily it can be found, retrieved, accessed, filtered and managed.  ... 
doi:10.1007/978-3-642-40897-7_3 fatcat:q6seu2otjbbtbn7d74fmvl45wu

Locally Balanced Incremental Hierarchical Discriminant Regression [chapter]

Xiao Huang, Juyang Weng, Roger Calantone
2003 Lecture Notes in Computer Science  
The algorithm was successfully applied to different kinds of data set.  ...  In this paper, we present the Locally Balanced Incremental Hierarchical Discriminant Regression (LBIHDR) algorithm.  ...  A summary of the performance comparison with some existing major tree classifiers is listed in Table 3 . We plugged in the result of major tree algorithms from [11] .  ... 
doi:10.1007/978-3-540-45080-1_26 fatcat:uj3cmpogmjbhjbbqshoa3z7hqy

Case-based reasoning supported by genetic algorithms for corporate bond rating

Kyung-shik Shin, Ingoo Han
1999 Expert systems with applications  
Among these tasks, one of the critical issues in building useful CBR system lies in indexing of cases that supports the retrieval of relevant cases to the problem.  ...  This paper investigates the effectiveness of integrated approach using induction techniques to case indexing process for business classification tasks.  ...  For example, the number of leaves increases from 8 to 746 depends on the depth of tree.  ... 
doi:10.1016/s0957-4174(98)00063-3 fatcat:zv6754unajguhgqet3oiuwrho4

Sketch-based human motion retrieval via selected 2D geometric posture descriptor

Jun Xiao, Zhangpeng Tang, Yinfu Feng, Zhidong Xiao
2015 Signal Processing  
Since the original 2GPD is of high dimension and redundant, a semi-supervised feature selection algorithm derived from Laplacian Score is then adopted to select the most discriminative feature component  ...  Finally, a posture-by-posture motion retrieval algorithm is used to retrieve a motion sequence by sketching several key postures.  ...  The overflow of our retrieval algorithm with an example. accuracy of Li's method with trajectory is close to ours.  ... 
doi:10.1016/j.sigpro.2015.01.004 fatcat:wev3tr2wnfdgro6lrdtmdi6ply

Revisiting Local Descriptors via Frequent Pattern Mining for Fine-Grained Image Retrieval

Min Zheng, Yangliao Geng, Qingyong Li
2022 Entropy  
The main difficulty of this task derives from the small interclass distinction and the large intraclass variance of fine-grained images, posing severe challenges to the methods that only resort to global  ...  Further, an aggregation feature that learns global–local aware feature representation is designed. Consequently, the discriminative ability among different fine-grained classes is enhanced.  ...  Conflicts of Interest: The authors declare no conflict of interest. Entropy 2022, 24, 156  ... 
doi:10.3390/e24020156 pmid:35205452 pmcid:PMC8871172 fatcat:skhn7z2khff67gjb7x4a6wbxne

Balancing Deformability and Discriminability for Shape Matching [chapter]

Haibin Ling, Xingwei Yang, Longin Jan Latecki
2010 Lecture Notes in Computer Science  
In this framework, an object is embedded as a surface in a higher dimensional space with a parameter named aspect weight, which controls the importance of intensity in the embedding.  ...  In the standard shape retrieval experiment using the MPEG7 CE-Shape-1 database, the new descriptor with context information achieves a bull's eye score of 95.96%, which surpassed all previous results.  ...  Acknowledgments We thank anonymous reviewers for helpful comments. The work is supported in part by the NSF Grants IIS-0916624, IIS-0812118, BCS-0924164, and the AFOSR Grant FA9550-09-1-0207.  ... 
doi:10.1007/978-3-642-15558-1_30 fatcat:7yxkv6dvobh7zm6fizecck6424

Hierarchical discriminant regression

J. Weng, W.-S. Hwang
2000 IEEE Transactions on Pattern Analysis and Machine Intelligence  
for computing clusters in the input space. 2) Discriminants in the input space are automatically derived from the clusters in the input space.  ...  empirical logarithmic time complexity of the HDR algorithm.  ...  They would like to acknowledge the contribution of the SVM softwares from Royal Holloway, University of London [23] .  ... 
doi:10.1109/34.888712 fatcat:exy737fkdbhuzdveqlljbmgsje

Page 8102 of Mathematical Reviews Vol. , Issue 98M [page]

1998 Mathematical Reviews  
Kalman (NZ-AUCK; Auckland) 98m:68239 68T15 03B35 de Nivelle, Hans (NL-MATH; Amsterdam) An algorithm for the retrieval of unifiers from discrimination trees.  ...  Summary: “We present a modification of the unification algo- rithm that is adapted to the extraction of simultaneously unifiable literals from discrimination trees.  ... 

Progressively Optimized Bi-Granular Document Representation for Scalable Embedding Based Retrieval [article]

Shitao Xiao, Zheng Liu, Weihao Han, Jianjin Zhang, Yingxia Shao, Defu Lian, Chaozhuo Li, Hao Sun, Denvy Deng, Liangjie Zhang, Qi Zhang, Xing Xie
2022 arXiv   pre-print
Ad-hoc search calls for the selection of appropriate answers from a massive-scale corpus.  ...  For the best of retrieval accuracy, a Progressive Optimization framework is designed. The sparse embeddings are learned ahead for high-quality search of candidates.  ...  The ANN index has been studied for a long time. Many of the early works were developed based on space partitioning; e.g., LSH [8] , BBF KD-Tree [2] , K-means Tree [29] .  ... 
arXiv:2201.05409v3 fatcat:eyofrsjwanh5zkmwuzl7ksvmmm

Image Annotations using Machine Learning and Features of ID3 Algorithm

D.V.N Harish, Y. Srinivas, K.N.V.S.S.K Rajesh, P. Anuradha
2011 International Journal of Computer Applications  
If the tree gives the correct answer discrimination.  ...  It is therefore a Histogram, this value is passed as the initial estimate for K- needed to develop new methodologies which help to retrieve Means algorithm. the image or content from the image  ... 
doi:10.5120/3024-4090 fatcat:anrkrhxdabdoda75c2iwr3z77y

Substitution tree indexing [chapter]

Peter Graf
1995 Lecture Notes in Computer Science  
The performance of a theorem prover crucially depends on the speed of the basic retrieval operations, such as finding terms that are unifiable with (instances of, or more general than) a given query term  ...  Additionally, the new index not only supports term indexing but also provides maintenance and efficient retrieval of substitutions.  ...  Acknowledgements Thanks to Hans Jürgen Ohlbach for his comments on earlier versions of this report. I also like to thank William McCune for providing a part of the term sets.  ... 
doi:10.1007/3-540-59200-8_52 fatcat:zmbx6yldtnbv7n3usfszoyqhby
« Previous Showing results 1 — 15 out of 9,216 results