Sciweavers

3443 search results - page 131 / 689
» More Algebras for Determiners
Sort
View
RSA
2002
81views more  RSA 2002»
13 years 10 months ago
Decycling numbers of random regular graphs
: The decycling number (G) of a graph G is the smallest number of vertices which can be removed from G so that the resultant graph contains no cycles. In this paper, we study the d...
Sheng Bau, Nicholas C. Wormald, Sanming Zhou
PVLDB
2008
123views more  PVLDB 2008»
13 years 10 months ago
Propagating functional dependencies with conditions
The dependency propagation problem is to determine, given a view defined on data sources and a set of dependencies on the sources, whether another dependency is guaranteed to hold...
Wenfei Fan, Shuai Ma, Yanli Hu, Jie Liu, Yinghui W...
IJAR
2010
113views more  IJAR 2010»
13 years 8 months ago
A geometric view on learning Bayesian network structures
We recall the basic idea of an algebraic approach to learning Bayesian network (BN) structures, namely to represent every BN structure by a certain (uniquely determined) vector, c...
Milan Studený, Jirí Vomlel, Raymond ...
PVLDB
2010
122views more  PVLDB 2010»
13 years 8 months ago
Avalanche-Safe LINQ Compilation
We report on a query compilation technique that enables the construction of alternative efficient query providers for Microsoft’s Language Integrated Query (LINQ) framework. LIN...
Torsten Grust, Jan Rittinger, Tom Schreiber
FDTC
2010
Springer
138views Cryptology» more  FDTC 2010»
13 years 8 months ago
A Continuous Fault Countermeasure for AES Providing a Constant Error Detection Rate
Many implementations of cryptographic algorithms have shown to be susceptible to fault attacks. For some of them, countermeasures against specific fault models have been proposed. ...
Marcel Medwed, Jörn-Marc Schmidt