9842 search results - page 1658 / 1969 » The Complexity of the Matching-Cut Problem |
149
click to vote
IPPS
2000
IEEE
15 years 9 months ago
2000
IEEE
Reconstructing a physical map of a chromosome from a genomic library presents a central computational problem in genetics. Physical map reconstruction in the presence of errors is...
143
click to vote
ASIACRYPT
2000
Springer
15 years 9 months ago
2000
Springer
Abstract. Construction of secure hyperelliptic curves is of most important yet most difficult problem in design of cryptosystems based on the discrete logarithm problems on hyperel...
133
click to vote
DIAGRAMS
2000
Springer
15 years 9 months ago
2000
Springer
This paper examines capacity limits in mental animation of static diagrams of mechanical systems and interprets these limits within current theories of working memory. I review emp...
142
click to vote
DAC
1999
ACM
15 years 9 months ago
1999
ACM
This paper presents a new algorithm for exact estimation of the minimum memory size required by programs dealing with array computations. Memory size is an important factor a ecti...
151
click to vote
PPOPP
1999
ACM
15 years 9 months ago
1999
ACM
A central problem in executing performance critical parallel and distributed applications on shared networks is the selection of computation nodes and communication paths for exec...