Sciweavers

960 search results - page 148 / 192
» There's no Data like More Data
Sort
View
CIKM
2006
Springer
14 years 22 days ago
TRIPS and TIDES: new algorithms for tree mining
Recent research in data mining has progressed from mining frequent itemsets to more general and structured patterns like trees and graphs. In this paper, we address the problem of...
Shirish Tatikonda, Srinivasan Parthasarathy, Tahsi...
CIKM
2008
Springer
13 years 11 months ago
Answering general time sensitive queries
Time is an important dimension of relevance for a large number of searches, such as over blogs and news archives. So far, research on searching over such collections has largely f...
Wisam Dakka, Luis Gravano, Panagiotis G. Ipeirotis
CPM
2008
Springer
134views Combinatorics» more  CPM 2008»
13 years 10 months ago
An Improved Succinct Representation for Dynamic k-ary Trees
Abstract. k-ary trees are a fundamental data structure in many textprocessing algorithms (e.g., text searching). The traditional pointer-based representation of trees is space cons...
Diego Arroyuelo
AI
2008
Springer
13 years 9 months ago
Speculative plan execution for information gathering
The execution performance of an information gathering plan can suffer significantly due to remote I/O latencies. A streaming dataflow model of execution addresses the problem to s...
Greg Barish, Craig A. Knoblock
BMCBI
2007
165views more  BMCBI 2007»
13 years 9 months ago
Automatic reconstruction of a bacterial regulatory network using Natural Language Processing
Background: Manual curation of biological databases, an expensive and labor-intensive process, is essential for high quality integrated data. In this paper we report the implement...
Carlos Rodríguez Penagos, Heladia Salgado, ...