Sciweavers

232 search results - page 22 / 47
» Context-Centric Needs Anticipation Using Information Needs G...
Sort
View
EMNLP
2007
13 years 11 months ago
Lexical Semantic Relatedness with Random Graph Walks
Many systems for tasks such as question answering, multi-document summarization, and information retrieval need robust numerical measures of lexical relatedness. Standard thesauru...
Thad Hughes, Daniel Ramage
EKAW
2006
Springer
14 years 1 months ago
Capturing Quantified Constraints in FOL, Through Interaction with a Relationship Graph
As new semantic web standards evolve to allow quantified rules in FOL, we need new ways to capture them from end users. We show how to do this against a graphic view of entities an...
Peter M. D. Gray, Graham J. L. Kemp
CIKM
2009
Springer
14 years 4 months ago
Fast shortest path distance estimation in large networks
In this paper we study approximate landmark-based methods for point-to-point distance estimation in very large networks. These methods involve selecting a subset of nodes as landm...
Michalis Potamias, Francesco Bonchi, Carlos Castil...
HICSS
2007
IEEE
118views Biometrics» more  HICSS 2007»
14 years 4 months ago
Introducing Executable Product Models for the Service Industry
In these days, companies need highly flexible processes to deal with changing environments and competitors. Using traditional process models that have to be modeled in all detail...
Markus Kress, Joachim Melcher, Detlef Seese
CC
2008
Springer
172views System Software» more  CC 2008»
13 years 11 months ago
Efficient Context-Sensitive Shape Analysis with Graph Based Heap Models
The performance of heap analysis techniques has a significant impact on their utility in an optimizing compiler. Most shape analysis techniques perform interprocedural dataflow ana...
Mark Marron, Manuel V. Hermenegildo, Deepak Kapur,...