13603 search results - page 293 / 2721 » On the Complexity of Computing Treelength |
140
Voted
ICIP
1997
IEEE
16 years 7 months ago
1997
IEEE
We develop a new approach to image denoising based on complexity regularization. This technique presents a flexible alternative to the more conventional l2 , l1 , and Besov regula...
166
click to vote
ICALP
2007
Springer
16 years 8 days ago
2007
Springer
Abstract. We study – within the framework of propositional proof complexity – the problem of certifying unsatisfiability of CNF formulas under the promise that any satisfiabl...
135
click to vote
ISCAS
2006
IEEE
16 years 4 days ago
2006
IEEE
- The novel CORDIC-based architecture of the these weights (combiner unit). The implementation of the Triangular Systolic Array for QRD of large size complex combiner unit is rathe...
145
click to vote
ICALP
2005
Springer
15 years 11 months ago
2005
Springer
We develop a new method for estimating the discrepancy of tensors associated with multiparty communication problems in the “Number on the Forehead” model of Chandra, Furst and...
140
click to vote
ICALP
2005
Springer
15 years 11 months ago
2005
Springer
We consider the problem of testing the commutativity of a black-box group specified by its k generators. The complexity (in terms of k) of this problem was first considered by Pa...