Sciweavers

1711 search results - page 183 / 343
» Completing pseudojump operators
Sort
View
CORR
2011
Springer
142views Education» more  CORR 2011»
13 years 3 months ago
A Logical Method for Policy Enforcement over Evolving Audit Logs
We present an iterative algorithm for enforcing policies represented in a first-order logic, which can, in particular, express all transmission-related clauses in the HIPAA Priva...
Deepak Garg, Limin Jia, Anupam Datta
CMIG
2010
110views more  CMIG 2010»
13 years 3 months ago
Unsupervised SVM-based gridding for DNA microarray images
This paper presents a novel method for unsupervised DNA microarray gridding based on Support Vector Machines (SVMs). Each spot is a small region on the microarray surface where cha...
Dimitris G. Bariamis, Dimitris Maroulis, Dimitrios...
RSA
2011
124views more  RSA 2011»
13 years 3 months ago
Sparse random graphs with clustering
In 2007 we introduced a general model of sparse random graphs with independence between the edges. The aim of this paper is to present an extension of this model in which the edge...
Béla Bollobás, Svante Janson, Oliver...
JAR
2010
95views more  JAR 2010»
13 years 3 months ago
Equivariant Unification
Nominal logic is a variant of first-order logic with special facilities for reasoning about names and binding based on the underlying concepts of swapping and freshness. It serves ...
James Cheney
JMLR
2010
157views more  JMLR 2010»
13 years 3 months ago
Why are DBNs sparse?
Real stochastic processes operating in continuous time can be modeled by sets of stochastic differential equations. On the other hand, several popular model families, including hi...
Shaunak Chatterjee, Stuart Russell