Sciweavers

549 search results - page 65 / 110
» On the Complexity of Restricted k-anonymity Problem
Sort
View
TKDE
2008
121views more  TKDE 2008»
14 years 9 months ago
On Modularity Clustering
Modularity is a recently introduced quality measure for graph clusterings. It has immediately received considerable attention in several disciplines, and in particular in the compl...
Ulrik Brandes, Daniel Delling, Marco Gaertler, Rob...
AI
2002
Springer
14 years 9 months ago
Conditional independence in propositional logic
Independence--the study of what is relevant to a given problem of reasoning--is an important AI topic. In this paper, we investigate several notions of conditional independence in...
Jérôme Lang, Paolo Liberatore, Pierre...
RECOMB
2010
Springer
14 years 8 months ago
Consistency of Sequence-Based Gene Clusters
In comparative genomics, various combinatorial models can be used to specify gene clusters — groups of genes that are co-located in a set of genomes. Several approaches have been...
Roland Wittler, Jens Stoye
SACMAT
2004
ACM
15 years 3 months ago
Role-based access control in ambient and remote space
In the era of Ubiquitous Computing and world–wide data transfer mobility, as an innovative aspect of professional activities, imposes new and complex problems of mobile and dist...
Horst Wedde, Mario Lischka
ESANN
2006
14 years 11 months ago
Non-linear gating network for the large scale classification model CombNET-II
The linear gating classifier (stem network) of the large scale model CombNET-II has been always the limiting factor which restricts the number of the expert classifiers (branch net...
Mauricio Kugler, Toshiyuki Miyatani, Susumu Kuroya...