Sciweavers

702 search results - page 58 / 141
» Identifying Graph Automorphisms Using Determining Sets
Sort
View
ESEC
1997
Springer
15 years 4 months ago
Verification of Liveness Properties Using Compositional Reachability Analysis
The software architecture of a distributed program can be represented by a hierarchical composition of subsystems, with interacting processes at the leaves of the hierarchy. Compo...
Shing-Chi Cheung, Dimitra Giannakopoulou, Jeff Kra...
ASUNAM
2010
IEEE
15 years 1 months ago
A Unified Framework for Link Recommendation Using Random Walks
The phenomenal success of social networking sites, such as Facebook, Twitter and LinkedIn, has revolutionized the way people communicate. This paradigm has attracted the attention ...
Zhijun Yin, Manish Gupta, Tim Weninger, Jiawei Han
IV
2009
IEEE
107views Visualization» more  IV 2009»
15 years 6 months ago
Multiscale Visual Analysis of Lexical Networks
A lexical network is a very useful resource for natural language processing systems. However, building high quality lexical networks is a complex task. “Jeux de mots” is a web...
Guillaume Artignan, Mountaz Hascoët, Mathieu ...
CP
2005
Springer
15 years 5 months ago
Speeding Up Constrained Path Solvers with a Reachability Propagator
Constrained path problems have to do with finding paths in graphs subject to constraints. One way of constraining the graph is by enforcing reachability on nodes. For instance, i...
Luis Quesada, Peter Van Roy, Yves Deville
LREC
2010
169views Education» more  LREC 2010»
15 years 1 months ago
Identification of the Question Focus: Combining Syntactic Analysis and Ontology-based Lookup through the User Interaction
Most question-answering systems contain a classifier module which determines a question category, based on which each question is assigned an answer type. However, setting up synt...
Danica Damljanovic, Milan Agatonovic, Hamish Cunni...