13603 search results - page 257 / 2721 » On the Complexity of Computing Treelength |
155
click to vote
PKDD
2004
Springer
15 years 11 months ago
2004
Springer
One of the most important operations involving Data Mining patterns is computing their similarity. In this paper we present a general framework for comparing both simple and comple...
159
click to vote
CORR
2007
Springer
15 years 5 months ago
2007
Springer
We survey results in algebraic complexity theory, focusing on matrix multiplication. Our goals are (i.) to show how open questions in algebraic complexity theory are naturally pose...
182
click to vote
CVPR
2005
IEEE
16 years 8 months ago
2005
IEEE
This article introduces the absolute quadratic complex formed by all lines that intersect the absolute conic. If denotes the 3 ? 3 symmetric matrix representing the image of that ...
144
click to vote
CHI
2002
ACM
16 years 6 months ago
2002
ACM
Informal, sketch-based design tools closely match the work practices of user interface designers. Current tools, however, are limited in the size and complexity of interaction tha...
154
click to vote
STACS
2010
Springer
16 years 27 days ago
2010
Springer
The degree of a CSP instance is the maximum number of times that a variable may appear in the scope of constraints. We consider the approximate counting problem for Boolean CSPs wi...