Sciweavers

3778 search results - page 461 / 756
» Erdos-Ko-Rado for three sets
Sort
View
SODA
2004
ACM
111views Algorithms» more  SODA 2004»
15 years 8 months ago
Almost-Delaunay simplices: nearest neighbor relations for imprecise points
Delaunay tessellations and Voronoi diagrams capture proximity relationships among sets of points in any dimension. When point coordinates are not known exactly, as in the case of ...
Deepak Bandyopadhyay, Jack Snoeyink
IJCAI
2003
15 years 8 months ago
Point-based value iteration: An anytime algorithm for POMDPs
This paper introduces the Point-Based Value Iteration (PBVI) algorithm for POMDP planning. PBVI approximates an exact value iteration solution by selecting a small set of represen...
Joelle Pineau, Geoffrey J. Gordon, Sebastian Thrun
TREC
2004
15 years 8 months ago
THUIR at TREC 2004: QA
In this paper, we describe ideas and related experiments of Tsinghua University IR group in TREC 2004 QA track. In this track, our system consists three components: Question analy...
Wei Tan 0002, Qunxiu Chen, Shaoping Ma
TREC
2004
15 years 8 months ago
Language Models for Searching in Web Corpora
: We describe our participation in the TREC 2004 Web and Terabyte tracks. For the web track, we employ mixture language models based on document full-text, incoming anchortext, and...
Jaap Kamps, Gilad Mishne, Maarten de Rijke
AAAI
1998
15 years 8 months ago
Knowledge Lean Word-Sense Disambiguation
We present a corpus{based approach to word{sense disambiguation that only requires information that can be automatically extracted from untagged text. We use unsupervised techniqu...
Ted Pedersen, Rebecca F. Bruce