MST
2010
12 years 11 months ago
2010
The 1-versus-2 queries problem, which has been extensively studied in computational complexity theory, asks in its generality whether every efficient algorithm that makes at most 2...
JMLR
2010
12 years 11 months ago
2010
Variational Bayesian (VB) methods are typically only applied to models in the conjugate-exponential family using the variational Bayesian expectation maximisation (VB EM) algorith...
CORR
2010
Springer
13 years 29 days ago
2010
Springer
It is proven that the connected pathwidth of any graph G is at most 2
IJISEC
2002
13 years 3 months ago
2002
In this paper we describe an efficient algorithm for the management of group-keys for Group Communication Systems. Our algorithm is based on the notion of key-graphs, previously u...
SIGPRO
2008
13 years 4 months ago
2008
: In this letter, an efficient algorithm for three-dimensional (3-D) vector radix decimation in frequency is derived for computing the type-III 3-D discrete W transform (DWT). Comp...
PAMI
2008
13 years 4 months ago
2008
This paper presents an efficient algorithm for iris recognition using phase-based image matching--an image matching technique using phase components in 2D Discrete Fourier Transfor...
IJFCS
2006
13 years 4 months ago
2006
In this paper we present an efficient algorithm for compile-time scheduling and clustering of parallel programs onto parallel processing systems with distributed memory, which is ...
IJES
2006
13 years 4 months ago
2006
: We present efficient solutions for the non-contiguous linear placement of data-paths for reconfigurable fabrics. A strip-based architecture is assumed for the reconfigurable fabr...
IJAC
2008
13 years 4 months ago
2008
We give an efficient algorithm to randomly generate finitely generated subgroups of a given size, in a finite rank free group. Here, the size of a subgroup is the number of vertic...
CORR
2008
Springer
13 years 4 months ago
2008
Springer
Let X[0..n - 1] and Y [0..m - 1] be two sorted arrays, and define the m