Sciweavers

115 search results - page 7 / 23
» Rank 2 Types for Term Graph Rewriting
Sort
View
DCG
2002
66views more  DCG 2002»
13 years 7 months ago
Generation of Oriented Matroids - A Graph Theoretical Approach
We discuss methods for the generation of oriented matroids and of isomorphism classes of oriented matroids. Our methods are based on single element extensions and graph theoretica...
Lukas Finschi, Komei Fukuda
CIKM
2010
Springer
13 years 6 months ago
Ranking related entities: components and analyses
Related entity finding is the task of returning a ranked list of homepages of relevant entities of a specified type that need to engage in a given relationship with a given sour...
Marc Bron, Krisztian Balog, Maarten de Rijke
WWW
2007
ACM
14 years 8 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
HIPC
2007
Springer
14 years 1 months ago
Distributed Ranked Search
P2P deployments are a natural infrastructure for building distributed search networks. Proposed systems support locating and retrieving all results, but lack the information necess...
Vijay Gopalakrishnan, Ruggero Morselli, Bobby Bhat...
COLING
1992
13 years 8 months ago
A Treatment Of Negative Descriptions Of Typed Feature Structures
A formal treatment of typed feature structures (TFSs) is developed to augment TFSs, so that negative descriptions of them can be treated. Negative descriptions of TFSs can make li...
Kiyoshi Kogure