13603 search results - page 336 / 2721 » On the Complexity of Computing Treelength |
208
Voted
COCO
2009
Springer
16 years 2 months ago
2009
Springer
—We study the one-way number-on-the-forhead (NOF) communication complexity of the k-layer pointer jumping problem. Strong lower bounds for this problem would have important impli...
187
Voted
ICASSP
2008
IEEE
16 years 1 months ago
2008
IEEE
The desirable asymptotic optimality properties of the maximum likelihood (ML) estimator make it an attractive solution for performing independent component analysis (ICA) as well....
197
Voted
POLICY
2007
Springer
16 years 1 months ago
2007
Springer
This paper presents ongoing research and current results on the development of flexible access control infrastructure for complex resource provisioning (CRP) in Grid-based applica...
209
click to vote
AICT
2005
IEEE
16 years 1 months ago
2005
IEEE
The choice of the scheduling algorithm is a major design criteria of a switch. Whereas it is known that maximum weight matching algorithms guarantee the stability of an input queu...
181
click to vote
MFCS
2005
Springer
16 years 1 months ago
2005
Springer
We investigate the complexity of finding prime implicants and minimal equivalent DNFs for Boolean formulas, and of testing equivalence and isomorphism of monotone formulas. For DN...