Sciweavers

606 search results - page 113 / 122
» words 2002
Sort
View
NLE
2008
108views more  NLE 2008»
13 years 10 months ago
Using automatically labelled examples to classify rhetorical relations: an assessment
Being able to identify which rhetorical relations (e.g., contrast or explanation) hold between spans of text is important for many natural language processing applications. Using ...
Caroline Sporleder, Alex Lascarides
AI
2002
Springer
13 years 10 months ago
Improving heuristic mini-max search by supervised learning
This article surveys three techniques for enhancing heuristic game-tree search pioneered in the author's Othello program Logistello, which dominated the computer Othello scen...
Michael Buro
ALGORITHMICA
2002
103views more  ALGORITHMICA 2002»
13 years 10 months ago
Efficient Bulk Operations on Dynamic R-Trees
In recent years there has been an upsurge of interest in spatial databases. A major issue is how to manipulate efficiently massive amounts of spatial data stored on disk in multidi...
Lars Arge, Klaus Hinrichs, Jan Vahrenhold, Jeffrey...
ALGORITHMICA
2002
97views more  ALGORITHMICA 2002»
13 years 10 months ago
Testing and Spot-Checking of Data Streams
Abstract. We consider the tasks of testing and spot-checking for data streams. These testers and spotcheckers are potentially useful in real-time or near real-time applications tha...
Joan Feigenbaum, Sampath Kannan, Martin Strauss, M...
BMCBI
2002
131views more  BMCBI 2002»
13 years 10 months ago
Efficient Boolean implementation of universal sequence maps (bUSM)
Background: Recently, Almeida and Vinga offered a new approach for the representation of arbitrary discrete sequences, referred to as Universal Sequence Maps (USM), and discussed ...
John Schwacke, Jonas S. Almeida