961 search results - page 111 / 193 » An Algorithm for Computing Semi-stable Semantics |
FCT
2005
Springer
14 years 2 months ago
2005
Springer
In the pattern matching problem, there can be a quadratic number of matching substrings in the size of a given text. The linearizing restriction finds, at most, a linear number of...
ICCS
2004
Springer
14 years 2 months ago
2004
Springer
Abstract. The unpredictable run-time configurations of dynamic, datadriven application systems require flexible simulation components that can adapt to changes in the number of i...
IV
2003
IEEE
14 years 2 months ago
2003
IEEE
This paper describes a radial layout method for displaying B+ -tree data structures. We present an algorithmic framework for computing the node positions that result in a planar d...
NLE
2010
13 years 7 months ago
2010
Distributional similarity methods have proven to be a valuable tool for the induction of semantic similarity. Up till now, most algorithms use two-way cooccurrence data to compute...
SIGMOD
2009
ACM
14 years 9 months ago
2009
ACM
Uncertain data arises in a number of domains, including data integration and sensor networks. Top-k queries that rank results according to some user-defined score are an important...