251 search results - page 13 / 51 » Constructive Linear Time Algorithms for Branchwidth |
ICMCS
2005
IEEE
15 years 3 months ago
2005
IEEE
Virtual avatars in many applications are constructed manually or by a single speech-driven model which needs a lot of training data and long training time. It’s an essential pro...
CORR
2011
Springer
14 years 4 months ago
2011
Springer
The analysis of online least squares estimation is at the heart of many stochastic sequential decision-making problems. We employ tools from the self-normalized processes to provi...
MLDM
2005
Springer
15 years 3 months ago
2005
Springer
In this paper we describe a new cluster model which is based on the concept of linear manifolds. The method identifies subsets of the data which are embedded in arbitrary oriented...
CORR
2008
Springer
14 years 9 months ago
2008
Springer
Abstract--Interior-point methods are state-of-the-art algorithms for solving linear programming (LP) problems with polynomial complexity. Specifically, the Karmarkar algorithm typi...
DCC
2006
IEEE
15 years 9 months ago
2006
IEEE
So far there is no systematic attempt to construct Boolean functions with maximum annihilator immunity. In this paper we present a construction keeping in mind the basic theory of...