Sciweavers

1047 search results - page 85 / 210
» Searching Without a Heuristic: Efficient Use of Abstraction
Sort
View
ACL
2010
13 years 6 months ago
Hierarchical A* Parsing with Bridge Outside Scores
Hierarchical A (HA) uses of a hierarchy of coarse grammars to speed up parsing without sacrificing optimality. HA prioritizes search in refined grammars using Viterbi outside cost...
Adam Pauls, Dan Klein
AAAI
2008
13 years 10 months ago
Simulation-Based Approach to General Game Playing
The aim of General Game Playing (GGP) is to create intelligent agents that automatically learn how to play many different games at an expert level without any human intervention. ...
Hilmar Finnsson, Yngvi Björnsson
ER
2003
Springer
150views Database» more  ER 2003»
14 years 1 months ago
EITH - A Unifying Representation for Database Schema and Application Code in Enterprise Knowledge Extraction
The integration of heterogeneous legacy databases requires understanding of database structure and content. We previously developed a theoretical and software infrastructure to sup...
Mark S. Schmalz, Joachim Hammer, Mingxi Wu, Oguzha...
CIKM
2010
Springer
13 years 6 months ago
Who should I cite: learning literature search models from citation behavior
Scientists depend on literature search to find prior work that is relevant to their research ideas. We introduce a retrieval model for literature search that incorporates a wide ...
Steven Bethard, Dan Jurafsky
SIGIR
1998
ACM
14 years 3 days ago
Fast Searching on Compressed Text Allowing Errors
Abstract We present a fast compression and decompression scheme for natural language texts that allows e cient and exible string matching by searching the compressed text directly....
Edleno Silva de Moura, Gonzalo Navarro, Nivio Zivi...