Sciweavers

617 search results - page 100 / 124
» Improved techniques for result caching in web search engines
Sort
View
BMCBI
2010
183views more  BMCBI 2010»
13 years 10 months ago
SING: Subgraph search In Non-homogeneous Graphs
Background: Finding the subgraphs of a graph database that are isomorphic to a given query graph has practical applications in several fields, from cheminformatics to image unders...
Raffaele Di Natale, Alfredo Ferro, Rosalba Giugno,...
HICSS
2003
IEEE
182views Biometrics» more  HICSS 2003»
14 years 3 months ago
Business Intelligence Explorer: A Knowledge Map Framework for Discovering Business Intelligence on the Web
Nowadays, information overload hinders the discovery of business intelligence on the World Wide Web. Existing business intelligence tools suffer from a lack of analysis and visual...
Wingyan Chung, Hsinchun Chen, Jay F. Nunamaker
SIGIR
2010
ACM
14 years 1 months ago
Prototype hierarchy based clustering for the categorization and navigation of web collections
This paper presents a novel prototype hierarchy based clustering (PHC) framework for the organization of web collections. It solves simultaneously the problem of categorizing web ...
Zhaoyan Ming, Kai Wang, Tat-Seng Chua
DEXA
2009
Springer
176views Database» more  DEXA 2009»
13 years 7 months ago
Analyzing Document Retrievability in Patent Retrieval Settings
Most information retrieval settings, such as web search, are typically precision-oriented, i.e. they focus on retrieving a small number of highly relevant documents. However, in sp...
Shariq Bashir, Andreas Rauber
CSC
2008
13 years 11 months ago
Efficient and Effective Practical Algorithms for the Set-Covering Problem
- The set-covering problem is an interesting problem in computational complexity theory. In [1], the setcovering problem has been proved to be NP hard and a greedy heuristic algori...
Qi Yang, Jamie McPeek, Adam Nofsinger