Sciweavers

Share
TVCG
2012
184views Hardware» more  TVCG 2012»
7 years 9 months ago
Output-Sensitive Construction of Reeb Graphs
—The Reeb graph of a scalar function represents the evolution of the topology of its level sets. This paper describes a near-optimal output-sensitive algorithm for computing the ...
Harish Doraiswamy, Vijay Natarajan
SIGCOMM
2012
ACM
7 years 9 months ago
Route shepherd: stability hints for the control plane
The Route Shepherd tool demonstrates applications of choosing between routing protocol configurations on the basis of rigorouslysupported theory. Splitting the configuration spa...
Alexander J. T. Gurney, Xianglong Han, Yang Li, Bo...
ICC
2011
IEEE
217views Communications» more  ICC 2011»
8 years 6 months ago
Controlling LDPC Absorbing Sets via the Null Space of the Cycle Consistency Matrix
— This paper focuses on controlling absorbing sets for a class of regular LDPC codes, known as separable, circulantbased (SCB) codes. For a specified circulant matrix, SCB codes...
Jiadong Wang, Lara Dolecek, Richard D. Wesel
IACR
2011
106views more  IACR 2011»
8 years 6 months ago
Hash Functions Based on Three Permutations: A Generic Security Analysis
We consider the family of 2n-to-n-bit compression functions that are solely based on at most three permutation executions and on XOR-operators, and analyze its collision and preima...
Bart Mennink, Bart Preneel
IACR
2011
126views more  IACR 2011»
8 years 6 months ago
On Enumeration of Polynomial Equivalence Classes and Their Application to MPKC
The Isomorphism of Polynomials (IP) is one of the most fundamental problems in multivariate public key cryptography (MPKC). In this paper, we introduce a new framework to study th...
Dongdai Lin, Jean-Charles Faugère, Ludovic ...
DM
1998
95views more  DM 1998»
9 years 6 months ago
An Euler-type formula for median graphs
Let G be a median graph on n vertices and m edges and let k be the number of equivalence classes of the Djokovi´c’s relation Θ defined on the edge-set of G. Then 2n − m −...
Sandi Klavzar, Henry Martyn Mulder, Riste Skrekovs...
DM
2000
89views more  DM 2000»
9 years 7 months ago
On median graphs and median grid graphs
Let G be a Q4-free median graph on n vertices and m edges. Let k be the number of equivalence classes of Djokovi
Sandi Klavzar, Riste Skrekovski
AI
2002
Springer
9 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
IS
2008
9 years 7 months ago
On the expressibility of functions in XQuery fragments
XQuery is a powerful XML query language with many features and syntactic constructs. For many common queries we do not need all the expressive power of XQuery. We investigate the ...
Jan Hidders, Stefania Marrara, Jan Paredaens, Roel...
ASC
2006
9 years 7 months ago
Speeding up the learning of equivalence classes of bayesian network structures
For some time, learning Bayesian networks has been both feasible and useful in many problems domains. Recently research has been done on learning equivalence classes of Bayesian n...
Rónán Daly, Qiang Shen, J. Stuart Ai...
books