Sciweavers

100 search results - page 19 / 20
» Structured data retrieval using cover density ranking
Sort
View
LATIN
2010
Springer
14 years 7 days ago
Layered Working-Set Trees
The working-set bound [Sleator and Tarjan, J. ACM, 1985] roughly states that searching for an element is fast if the element was accessed recently. Binary search trees, such as sp...
Prosenjit Bose, Karim Douïeb, Vida Dujmovic, ...
WISE
2002
Springer
13 years 10 months ago
Log Mining to Improve the Performance of Site Search
Despite of the popularity of global search engines, people still suffer from low accuracy of site search. The primary reason lies in the difference of link structures and data sca...
Gui-Rong Xue, Hua-Jun Zeng, Zheng Chen, Wei-Ying M...
CIKM
2008
Springer
13 years 7 months ago
Mining conceptual graphs for knowledge acquisition
This work addresses the use of computational linguistic analysis techniques for conceptual graphs learning from unstructured texts. A technique including both content mining and i...
Milagros Fernández, Eric Villemonte de la C...
BMCBI
2010
150views more  BMCBI 2010»
13 years 5 months ago
Systematic calibration of a cell signaling network model
Background: Mathematical modeling is being applied to increasingly complex biological systems and datasets; however, the process of analyzing and calibrating against experimental ...
Kyoung Ae Kim, Sabrina L. Spencer, John G. Albeck,...
WWW
2003
ACM
14 years 6 months ago
Adaptive on-line page importance computation
The computation of page importance in a huge dynamic graph has recently attracted a lot of attention because of the web. Page importance, or page rank is defined as the fixpoint o...
Serge Abiteboul, Mihai Preda, Gregory Cobena