13603 search results - page 388 / 2721 » On the Complexity of Computing Treelength |
191
click to vote
IPPS
1998
IEEE
15 years 12 months ago
1998
IEEE
This paper describes a new parallel algorithm for Minimum Cost Path computation on the Polymorphic Processor Array, a massively parallel architecture based on a reconfigurable mesh...
194
click to vote
CRYPTO
2008
Springer
15 years 9 months ago
2008
Springer
We present the first general protocol for secure multiparty computation in which the total amount of work required by n players to compute a function f grows only polylogarithmical...
184
click to vote
TCAD
2008
15 years 7 months ago
2008
Abstract--Recent analytical global placers use density constraints to approximate nonoverlap constraints, and these show very successful results. This paper unifies a wide range of...
161
click to vote
GI
2004
Springer
16 years 29 days ago
2004
Springer
Abstract: The vision process is very complex and requires for its realization in artificial systems a fundamentally new technology for systems generation. This must be based on pr...
199
click to vote
IDA
2009
Springer
16 years 5 days ago
2009
Springer
Searching for interesting patterns in binary matrices plays an important role in data mining and, in particular, in formal concept analysis and related disciplines. Several algorit...