Sciweavers

1456 search results - page 152 / 292
» Two Techniques to Improve Finite Model Search
Sort
View
CP
2006
Springer
13 years 11 months ago
A New Algorithm for Sampling CSP Solutions Uniformly at Random
The paper presents a method for generating solutions of a constraint satisfaction problem (CSP) uniformly at random. The main idea is to express the CSP as a factored probability d...
Vibhav Gogate, Rina Dechter
ACL
1996
13 years 9 months ago
A New Statistical Parser Based on Bigram Lexical Dependencies
This paper describes a new statistical parser which is based on probabilities of dependencies between head-words in the parse tree. Standard bigram probability estimation techniqu...
Michael Collins
SIGIR
2005
ACM
14 years 1 months ago
Optimization strategies for complex queries
Previous research into the efficiency of text retrieval systems has dealt primarily with methods that consider inverted lists in sequence; these methods are known as term-at-a-tim...
Trevor Strohman, Howard R. Turtle, W. Bruce Croft
SIGIR
2008
ACM
13 years 8 months ago
User adaptation: good results from poor systems
Several recent studies have found only a weak relationship between the performance of a retrieval system and the "success" achievable by human searchers. We hypothesize ...
Catherine L. Smith, Paul B. Kantor
KI
2009
Springer
14 years 2 months ago
Meta-level Information Extraction
Abstract. This paper presents a novel approach for meta-level information extraction (IE). The common IE process model is extended by utilizing transfer knowledge and meta-features...
Peter Klügl, Martin Atzmueller, Frank Puppe