Sciweavers

Share
MST
2010
117views more  MST 2010»
7 years 10 months ago
The 1-Versus-2 Queries Problem Revisited
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...
Rahul Tripathi
JMLR
2010
136views more  JMLR 2010»
7 years 10 months ago
Approximate Riemannian Conjugate Gradient Learning for Fixed-Form Variational Bayes
Variational Bayesian (VB) methods are typically only applied to models in the conjugate-exponential family using the variational Bayesian expectation maximisation (VB EM) algorith...
Antti Honkela, Tapani Raiko, Mikael Kuusela, Matti...
CORR
2010
Springer
126views Education» more  CORR 2010»
8 years 4 days ago
From Pathwidth to Connected Pathwidth
It is proven that the connected pathwidth of any graph G is at most 2
Dariusz Dereniowski
IJISEC
2002
86views more  IJISEC 2002»
8 years 3 months ago
Using AVL trees for fault-tolerant group key management
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...
Ohad Rodeh, Kenneth P. Birman, Danny Dolev
SIGPRO
2008
89views more  SIGPRO 2008»
8 years 3 months ago
Radix-2 algorithm for the fast computation of type-III 3-D discrete W transform
: 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...
Huazhong Shu, J. S. Wu, Lotfi Senhadji, Limin Luo
PAMI
2008
143views more  PAMI 2008»
8 years 3 months ago
An Effective Approach for Iris Recognition Using Phase-Based Image Matching
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...
Kazuyuki Miyazawa, Koichi Ito, Takafumi Aoki, Koji...
IJFCS
2006
63views more  IJFCS 2006»
8 years 3 months ago
Critical Path Scheduling Parallel Programs on an Unbounded Number of Processors
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 ...
Mourad Hakem, Franck Butelle
IJES
2006
72views more  IJES 2006»
8 years 3 months ago
Non-contiguous linear placement for reconfigurable fabrics
: 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...
Cristinel Ababei, Kia Bazargan
IJAC
2008
97views more  IJAC 2008»
8 years 3 months ago
Random Generation of Finitely Generated Subgroups of a Free Group
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...
Frédérique Bassino, Cyril Nicaud, Pa...
CORR
2008
Springer
120views Education» more  CORR 2008»
8 years 3 months ago
Cache-Oblivious Selection in Sorted X+Y Matrices
Let X[0..n - 1] and Y [0..m - 1] be two sorted arrays, and define the m
Mark de Berg, Shripad Thite
books