Sciweavers

4372 search results - page 721 / 875
» Algorithmic Theories of Everything
Sort
View
ENTCS
2008
120views more  ENTCS 2008»
15 years 4 months ago
Reasoning about B+ Trees with Operational Semantics and Separation Logic
The B+ tree is an ordered tree structure with a fringe list. It is the most widely used data structure for data organisation and searching in database systems specifically, and, p...
Alan P. Sexton, Hayo Thielecke
IDA
2008
Springer
15 years 4 months ago
Symbolic methodology for numeric data mining
Currently statistical and artificial neural network methods dominate in data mining applications. Alternative relational (symbolic) data mining methods have shown their effectivene...
Boris Kovalerchuk, Evgenii Vityaev
CORR
2006
Springer
90views Education» more  CORR 2006»
15 years 4 months ago
The recognizability of sets of graphs is a robust property
Once the set of finite graphs is equipped with an algebra structure (arising from the definition of operations that generalize the concatenation of words), one can define the noti...
Bruno Courcelle, Pascal Weil
CVIU
2006
105views more  CVIU 2006»
15 years 4 months ago
The representation and matching of categorical shape
We present a framework for categorical shape recognition. The coarse shape of an object is captured by a multiscale blob decomposition, representing the compact and elongated part...
Ali Shokoufandeh, Lars Bretzner, Diego Macrini, M....
IJACT
2008
158views more  IJACT 2008»
15 years 4 months ago
Efficient lattice-based signature scheme
: In Crypto 1997, Goldreich, Goldwasser and Halevi (GGH) proposed a lattice analogue of McEliece public key cryptosystem, in which security is related to the hardness of approximat...
Thomas Plantard, Willy Susilo, Khin Than Win, Qion...