Sciweavers

5316 search results - page 1052 / 1064
» Which Search Problems Are Random
Sort
View
102
Voted
KDD
1998
ACM
147views Data Mining» more  KDD 1998»
15 years 4 months ago
ADtrees for Fast Counting and for Fast Learning of Association Rules
Abstract: The problem of discovering association rules in large databases has received considerable research attention. Much research has examined the exhaustive discovery of all a...
Brigham S. Anderson, Andrew W. Moore
179
Voted
SIGIR
1992
ACM
15 years 4 months ago
Bead: Explorations in Information Visualization
ct We describe work on the visualization of bibliographic data and, to aid in this task, the application of numerical techniques for multidimensional scaling. Many areas of scienti...
Matthew Chalmers, Paul Chitson
120
Voted
CIKM
2007
Springer
15 years 4 months ago
A fast unified optimal route query evaluation algorithm
We investigate the problem of how to evaluate, fast and efficiently, classes of optimal route queries on a massive graph in a unified framework. To evaluate a route query effectiv...
Edward P. F. Chan, Jie Zhang
106
Voted
ELPUB
2007
ACM
15 years 4 months ago
Beyond Publication - A Passage Through Project StORe
The principal aim of Project StORe is to provide middleware that will enable bi-directional links between source repositories of research data and the output repositories containi...
Graham Pryor
SIGIR
2010
ACM
15 years 4 months ago
Positional relevance model for pseudo-relevance feedback
Pseudo-relevance feedback is an effective technique for improving retrieval results. Traditional feedback algorithms use a whole feedback document as a unit to extract words for ...
Yuanhua Lv, ChengXiang Zhai
« Prev « First page 1052 / 1064 Last » Next »