Sciweavers

450 search results - page 57 / 90
» Estimating Search Tree Size
Sort
View
SIGIR
1998
ACM
13 years 12 months ago
Web Document Clustering: A Feasibility Demonstration
Users of Web search engines are often forced to sift through the long ordered list of document “snippets” returned by the engines. The IR community has explored document cluste...
Oren Zamir, Oren Etzioni
NAR
2008
103views more  NAR 2008»
13 years 7 months ago
DBD--taxonomically broad transcription factor predictions: new content and functionality
DNA-binding domain (DBD) is a database of predicted sequence-specific DNA-binding transcription factors (TFs) for all publicly available proteomes. The proteomes have increased fr...
Derek Wilson, Varodom Charoensawan, Sarah K. Kumme...
SSDBM
2002
IEEE
149views Database» more  SSDBM 2002»
14 years 15 days ago
A Cost Model for Interval Intersection Queries on RI-Trees
The efficient management of interval data represents a core requirement for many temporal and spatial database applications. With the Relational Interval Tree (RI-tree1 ), an effi...
Hans-Peter Kriegel, Martin Pfeifle, Marco Pöt...
DASFAA
2004
IEEE
158views Database» more  DASFAA 2004»
13 years 11 months ago
A Cost Model for Spatial Intersection Queries on RI-Trees
Abstract. The efficient management of interval sequences represents a core requirement for many temporal and spatial database applications. With the Relational Interval Tree (RI-tr...
Hans-Peter Kriegel, Martin Pfeifle, Marco Pöt...
ESANN
2008
13 years 9 months ago
Learning to play Tetris applying reinforcement learning methods
In this paper the application of reinforcement learning to Tetris is investigated, particulary the idea of temporal difference learning is applied to estimate the state value funct...
Alexander Groß, Jan Friedland, Friedhelm Sch...