Sciweavers

1033 search results - page 124 / 207
» The Relative History Heuristic
Sort
View
JUCS
2000
91views more  JUCS 2000»
14 years 11 months ago
Syntax, Parsing and Production of Natural Language in a Framework of Information Compression by Multiple Alignment, Unification
This article introduces the idea that information compression by multiple alignment, unification and search (ICMAUS) provides a framework within which natural language syntax may ...
J. Gerard Wolff
TKDE
2002
127views more  TKDE 2002»
14 years 11 months ago
Efficient Join-Index-Based Spatial-Join Processing: A Clustering Approach
A join-index is a data structure used for processing join queries in databases. Join-indices use precomputation techniques to speed up online query processing and are useful for da...
Shashi Shekhar, Chang-Tien Lu, Sanjay Chawla, Siva...
NPC
2010
Springer
14 years 10 months ago
Exposing Tunable Parameters in Multi-threaded Numerical Code
Achieving high performance on today’s architectures requires careful orchestration of many optimization parameters. In particular, the presence of shared-caches on multicore arch...
Apan Qasem, Jichi Guo, Faizur Rahman, Qing Yi
LPAR
2010
Springer
14 years 9 months ago
Automated Proof Compression by Invention of New Definitions
State-of-the-art automated theorem provers (ATPs) are today able to solve relatively complicated mathematical problems. But as ATPs become stronger and more used by mathematicians...
Jirí Vyskocil, David Stanovský, Jose...
NAACL
2010
14 years 9 months ago
Tree Edit Models for Recognizing Textual Entailments, Paraphrases, and Answers to Questions
We describe tree edit models for representing sequences of tree transformations involving complex reordering phenomena and demonstrate that they offer a simple, intuitive, and eff...
Michael Heilman, Noah A. Smith