Sciweavers

6597 search results - page 82 / 1320
» Orderings and Types in Databases
Sort
View
TPHOL
1992
IEEE
14 years 1 months ago
The HOL Logic Extended with Quantification over Type Variables
The HOL system is an LCF-style mechanized proof-assistant for conducting proofs in higher order logic. This paper discusses a proposal to extend the primitive basis of the logic un...
Thomas F. Melham
CORR
2009
Springer
80views Education» more  CORR 2009»
13 years 6 months ago
A Type System for a Stochastic CLS
claim that types are the right abstraction in order to represent the interaction between elements without specifying exactly the element positions. Our claim is supported through a...
Mariangiola Dezani-Ciancaglini, Paola Giannini, An...
ICDE
2007
IEEE
185views Database» more  ICDE 2007»
14 years 10 months ago
On k-Nearest Neighbor Searching in Non-Ordered Discrete Data Spaces
A k-nearest neighbor (k-NN) query retrieves k objects from a database that are considered to be the closest to a given query point. Numerous techniques have been proposed in the p...
Dashiell Kolbe, Qiang Zhu, Sakti Pramanik
PODS
2004
ACM
158views Database» more  PODS 2004»
14 years 9 months ago
Composing Schema Mappings: Second-Order Dependencies to the Rescue
A schema mapping is a specification that describes how data structured under one schema (the source schema) is to be transformed into data structured under a different schema (the...
Ronald Fagin, Phokion G. Kolaitis, Lucian Popa, Wa...
PROCEDIA
2010
123views more  PROCEDIA 2010»
13 years 7 months ago
Mean square convergence of a semidiscrete scheme for SPDEs of Zakai type driven by square integrable martingales
In this short note, a direct proof of L2 convergence of an Euler–Maruyama approximation of a Zakai equation driven by a square integrable martingale is shown. The order of conve...
Annika Lang