13603 search results - page 398 / 2721 » On the Complexity of Computing Treelength |
239
click to vote
ICDE
2010
IEEE
16 years 7 months ago
2010
IEEE
Scientific workflows are increasingly used for rapid integration of existing algorithms to form larger and more comgrams. Such workflows promise to provide more abstract, yet execu...
264
click to vote
SPRINGSIM
2010
15 years 6 months ago
2010
Concise and reliable graph-theoretic analysis of complex networks today is a cumbersome task, consisting essentially of the adaptation of intricate libraries for each specific pr...
165
click to vote
CRYPTO
2000
Springer
15 years 12 months ago
2000
Springer
Secure Function Evaluation (SFE) protocols are very hard to design, and reducibility has been recognized as a highly desirable property of SFE protocols. Informally speaking, reduc...
223
click to vote
PAMI
2007
15 years 7 months ago
2007
We consider the problem of detecting a large number of different classes of objects in cluttered scenes. Traditional approaches require applying a battery of different classifier...
229
click to vote
LICS
2010
IEEE
15 years 5 months ago
2010
IEEE
The universal-algebraic approach has proved a powerful tool in the study of the computational complexity of constraint satisfaction problems (CSPs). This approach has previously b...