Sciweavers

1220 search results - page 4 / 244
» Restricting grammatical complexity
Sort
View
COMCOM
2004
85views more  COMCOM 2004»
13 years 7 months ago
Optimal PNNI complex node representations for restrictive costs
The Private Network-to-Network Interface (PNNI) is a scalable hierarchical protocol that allows ATM switches to be aggregated into clusters called peer groups. To provide good acc...
Ilias Iliadis
APWEB
2008
Springer
13 years 9 months ago
On the Complexity of Restricted k-anonymity Problem
Abstract. One of the emerging concepts in microdata protection is kanonymity, introduced by Samarati and Sweeney. k-anonymity provides a simple and efficient approach to protect pr...
Xiaoxun Sun, Hua Wang, Jiuyong Li
AAAI
2000
13 years 8 months ago
The Complexity of Restricted Consequence Finding and Abduction
We analyze the complexity of propositional kernel resolution (del Val 1999), a general method for obtaining logical consequences in restricted target languages. Different choices ...
Alvaro del Val
TCS
2010
13 years 5 months ago
On the complexities of consistency checking for restricted UML class diagrams
Automatic debugging of UML class diagrams helps in the visual specification of software systems because users cannot detect errors in logical consistency easily. This paper focus...
Ken Kaneiwa, Ken Satoh
JMLR
2010
125views more  JMLR 2010»
13 years 2 months ago
Stochastic Complexity and Generalization Error of a Restricted Boltzmann Machine in Bayesian Estimation
In this paper, we consider the asymptotic form of the generalization error for the restricted Boltzmann machine in Bayesian estimation. It has been shown that obtaining the maximu...
Miki Aoyagi