Sciweavers

11862 search results - page 90 / 2373
» Relative information completeness
Sort
View
WEBI
2004
Springer
14 years 2 months ago
Finding Related Pages Using the Link Structure of the WWW
Most of the current algorithms for finding related pages are exclusively based on text corpora of the WWW or incorporate only authority or hub values of pages. In this paper, we ...
Paul-Alexandru Chirita, Daniel Olmedilla, Wolfgang...
MSCS
2008
97views more  MSCS 2008»
13 years 9 months ago
Logical relations for monadic types
Abstract. Software security can be ensured by specifying and verifying security properties of software using formal methods with strong theoretical bases. In particular, programs c...
Jean Goubault-Larrecq, Slawomir Lasota, David Nowa...
TACAS
2010
Springer
146views Algorithms» more  TACAS 2010»
14 years 4 months ago
Ranking Function Synthesis for Bit-Vector Relations
Ranking function synthesis is a key aspect to the success of modern termination provers for imperative programs. While it is wellknown how to generate linear ranking functions for ...
Byron Cook, Daniel Kroening, Philipp Rümmer, ...
DEXAW
2006
IEEE
111views Database» more  DEXAW 2006»
14 years 3 months ago
A Strongly Minimal Axiomatisation of Multivalued Dependencies in Incomplete Database Relations
We study inference rules for multivalued dependencies in relational databases with null values (NMVDs). The definition of NMVDs is dependent on the underlying relation schema and ...
Sebastian Link
SOFSEM
2004
Springer
14 years 2 months ago
Processing XPath Expressions in Relational Databases
Abstract. Research on processing XML documents gained much activity in recent times. XML query languages are mostly based on XPath expressions, which are used to select parts of XM...
Tadeusz Pankowski