Sciweavers

866 search results - page 92 / 174
» Algorithms for Comparing Pedigree Graphs
Sort
View
HEURISTICS
2006
120views more  HEURISTICS 2006»
13 years 9 months ago
A study of ACO capabilities for solving the maximum clique problem
This paper investigates the capabilities of the Ant Colony Optimization (ACO) meta-heuristic for solving the maximum clique problem, the goal of which is to find a largest set of ...
Christine Solnon, Serge Fenet
WWW
2005
ACM
14 years 10 months ago
Incremental page rank computation on evolving graphs
Link Analysis has been a popular and widely used Web mining technique, especially in the area of Web search. Various ranking schemes based on link analysis have been proposed, of ...
Prasanna Kumar Desikan, Nishith Pathak, Jaideep Sr...
ICCS
2009
Springer
14 years 3 months ago
Distinguishing Answers in Conceptual Graph Knowledge Bases
Abstract. In knowledge bases, the open world assumption and the ability to express variables may lead to an answer redundancy problem. This problem occurs when the returned answers...
Nicolas Moreau, Michel Leclère, Madalina Cr...
WWW
2007
ACM
14 years 10 months ago
Dynamic personalized pagerank in entity-relation graphs
Extractors and taggers turn unstructured text into entityrelation (ER) graphs where nodes are entities (email, paper, person, conference, company) and edges are relations (wrote, ...
Soumen Chakrabarti
WWW
2009
ACM
14 years 4 months ago
Building term suggestion relational graphs from collective intelligence
This paper proposes an effective approach to provide relevant search terms for conceptual Web search. ‘Semantic Term Suggestion’ function has been included so that users can f...
Jyh-Ren Shieh, Yung-Huan Hsieh, Yang-Ting Yeh, Tse...