Sciweavers

820 search results - page 63 / 164
» Finding low-utility data structures
Sort
View
SIGIR
2003
ACM
14 years 2 months ago
Combining document representations for known-item search
This paper investigates the pre-conditions for successful combination of document representations formed from structural markup for the task of known-item search. As this task is ...
Paul Ogilvie, James P. Callan
IJNVO
2011
47views more  IJNVO 2011»
13 years 3 months ago
Harvesting covert networks: a case study of the iMiner database
: Data collection of covert networks is an inherently difficult task because of the very nature of these networks. Researchers find it difficult to locate and access data relating ...
Nasrullah Memon, Uffe Kock Wiil, Reda Alhajj, Clau...
AAAI
1990
13 years 10 months ago
Constructor: A System for the Induction of Probabilistic Models
The probabilistic network technology is a knowledgebased technique which focuses on reasoning under uncertainty. Because of its well defined semantics and solid theoretical founda...
Robert M. Fung, Stuart L. Crawford
SIGSOFT
2007
ACM
14 years 9 months ago
Recommending random walks
We improve on previous recommender systems by taking advantage of the layered structure of software. We use a random-walk approach, mimicking the more focused behavior of a develo...
Zachary M. Saul, Vladimir Filkov, Premkumar T. Dev...
ICDE
2007
IEEE
167views Database» more  ICDE 2007»
14 years 10 months ago
GString: A Novel Approach for Efficient Search in Graph Databases
Graphs are widely used for modeling complicated data, including chemical compounds, protein interactions, XML documents, and multimedia. Information retrieval against such data ca...
Haoliang Jiang, Haixun Wang, Philip S. Yu, Shuigen...