Sciweavers

5499 search results - page 856 / 1100
» Generalized Rewrite Theories
Sort
View
CIKM
2010
Springer
15 years 5 months ago
Domain-independent entity coreference in RDF graphs
In this paper, we present a novel entity coreference algorithm for Semantic Web instances. The key issues include how to locate context information and how to utilize the context ...
Dezhao Song, Jeff Heflin
CIKM
2010
Springer
15 years 5 months ago
Hypergraph-based multilevel matrix approximation for text information retrieval
In Latent Semantic Indexing (LSI), a collection of documents is often pre-processed to form a sparse term-document matrix, followed by a computation of a low-rank approximation to...
Haw-ren Fang, Yousef Saad
CIKM
2010
Springer
15 years 5 months ago
Term necessity prediction
The probability that a term appears in relevant documents ( ) is a fundamental quantity in several probabilistic retrieval models, however it is difficult to estimate without rele...
Le Zhao, Jamie Callan
FUIN
2010
97views more  FUIN 2010»
15 years 5 months ago
Game Solution, Epistemic Dynamics and Fixed-Point Logics
Abstract. Current methods for solving games embody a form of “procedural rationality” that invites logical analysis in its own right. This paper is a brief case study of Backwa...
Johan van Benthem, Amélie Gheerbrant
IANDC
2010
68views more  IANDC 2010»
15 years 5 months ago
On the complexity of checking semantic equivalences between pushdown processes and finite-state processes
Simulation preorder/equivalence and bisimulation equivalence are the most commonly used equivalences in concurrency theory. Their standard definitions are often called strong sim...
Antonín Kucera, Richard Mayr