Sciweavers

768 search results - page 106 / 154
» Asymptotic Cellular Complexity
Sort
View
AI
2002
Springer
13 years 7 months ago
The size distribution for Markov equivalence classes of acyclic digraph models
Bayesian networks, equivalently graphical Markov models determined by acyclic digraphs or ADGs (also called directed acyclic graphs or dags), have proved to be both effective and ...
Steven B. Gillispie, Michael D. Perlman
SP
2010
IEEE
156views Security Privacy» more  SP 2010»
13 years 5 months ago
Round-Efficient Broadcast Authentication Protocols for Fixed Topology Classes
Abstract--We consider resource-constrained broadcast authentication for n receivers in a static, known network topology. There are only two known broadcast authentication protocols...
Haowen Chan, Adrian Perrig
COMPGEOM
2010
ACM
14 years 23 days ago
Finding shortest non-trivial cycles in directed graphs on surfaces
Let D be a weighted directed graph cellularly embedded in a surface of genus g, orientable or not, possibly with boundary. We describe algorithms to compute a shortest non-contrac...
Sergio Cabello, Éric Colin de Verdiè...
BMCBI
2006
122views more  BMCBI 2006»
13 years 7 months ago
Computational reconstruction of transcriptional regulatory modules of the yeast cell cycle
Background: A transcriptional regulatory module (TRM) is a set of genes that is regulated by a common set of transcription factors (TFs). By organizing the genome into TRMs, a liv...
Wei-Sheng Wu, Wen-Hsiung Li, Bor-Sen Chen
CVPR
2005
IEEE
14 years 9 months ago
Applying Neighborhood Consistency for Fast Clustering and Kernel Density Estimation
Nearest neighborhood consistency is an important concept in statistical pattern recognition, which underlies the well-known k-nearest neighbor method. In this paper, we combine th...
Kai Zhang, Ming Tang, James T. Kwok