Sciweavers

1211 search results - page 65 / 243
» Computing Manipulations of Ranking Systems
Sort
View
WWW
2007
ACM
14 years 9 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
APCHI
1998
IEEE
14 years 1 months ago
Mixed Task Domain Representation in VR-DIS
Direct manipulation interfaces are characterised according to the representation of the task domain: the domain objects and the effect of user operations on those objects. In the ...
M. K. D. Coomans, H. H. Achten
TACAS
2005
Springer
78views Algorithms» more  TACAS 2005»
14 years 2 months ago
Separating Fairness and Well-Foundedness for the Analysis of Fair Discrete Systems
Fair discrete systems (FDSs) are a computational model of concurrent programs where fairness assumptions are specified in terms of sets of states. The analysis of fair discrete sy...
Amir Pnueli, Andreas Podelski, Andrey Rybalchenko
GRID
2008
Springer
13 years 8 months ago
A Secure Grid Medical Data Manager Interfaced to the gLite Middleware
The medical community is producing and manipulating a tremendous volume of digital data for which computerized archiving, processing and analysis is needed. Grid infrastructures ar...
Johan Montagnat, Ákos Frohner, Daniel Jouve...
MFCS
2007
Springer
14 years 3 months ago
Transition Graphs of Rewriting Systems over Unranked Trees
We investigate algorithmic properties of infinite transition graphs that are generated by rewriting systems over unranked trees. Two kinds of such rewriting systems are studied. ...
Christof Löding, Alex Spelten