11740 search results - page 2000 / 2348 » More Problems in Rewriting |
165
click to vote
ESWS
2009
Springer
16 years 1 months ago
2009
Springer
The primary goal of the Semantic Web is to use URIs as a universal space to name anything, expanding from using URIs for webpages to URIs for “real objects and imaginary concepts...
187
click to vote
FCT
2009
Springer
16 years 1 months ago
2009
Springer
Weighted automata are finite automata with numerical weights on transitions. Nondeterministic weighted automata define quantitative languages L that assign to each word w a real ...
190
Voted
ICTIR
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. It is well known that pseudo-relevance feedback (PRF) improves the retrieval performance of Information Retrieval (IR) systems in general. However, a recent study by Cao ...
204
click to vote
IWCIA
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. In this paper, we address the problem of computing a canonical representation of an n-dimensional combinatorial map. To do so, we define two combinatorial map signatures...
152
click to vote
IWPEC
2009
Springer
16 years 1 months ago
2009
Springer
An induced matching in graph G is a matching which is an induced subgraph of G. Clearly, among two vertices with the same neighborhood (called twins) at most one is matched in any...