529 search results - page 81 / 106 » Improving verbose queries using subset distribution |
136
click to vote
GCB
1997
Springer
15 years 9 months ago
1997
Springer
Motivation: Database search programs such as FASTA, BLAST or a rigorous Smith–Waterman algorithm produce lists of database entries, which are assumed to be related to the query....
164
click to vote
IPPS
2008
IEEE
15 years 12 months ago
2008
IEEE
This paper describes how use the Java Swing HTMLEditorKit to perform multi-threaded web data mining on the EDGAR system (Electronic DataGathering, Analysis, and Retrieval system)....
144
click to vote
CIKM
2004
Springer
15 years 11 months ago
2004
Springer
Our work is motivated by the problem of ranking hyperlinked documents for a given query. Given an arbitrary directed graph with edge and node labels, we present a new flow-based ...
154
click to vote
CASCON
2001
15 years 6 months ago
2001
On Line Analytical Processing (OLAP) aims at gaining useful information quickly from large amounts of data residing in a data warehouse. To improve the quickness of response to qu...
186
click to vote
MSWIM
2006
ACM
15 years 11 months ago
2006
ACM
In recent years different authors have proposed the used of random-walk-based algorithms for varying tasks in the networking community. These proposals include searching, routing...