18306 search results - page 83 / 3662 » Algorithmics in Exponential Time |
STOC
2006
ACM
15 years 3 months ago
2006
ACM
It has been known for some time that graph isomorphism reduces to the hidden subgroup problem (HSP). What is more, most exponential speedups in quantum computation are obtained by...
COMGEO
2004
ACM
14 years 9 months ago
2004
ACM
We introduce a novel technique for drawing proximity graphs in polynomial area and volume. Previously known algorithms produce representations whose size increases exponentially w...
ICML
2000
IEEE
15 years 10 months ago
2000
IEEE
Cross-validation is an established technique for estimating the accuracy of a classifier and is normally performed either using a number of random test/train partitions of the dat...
STACS
2010
Springer
15 years 4 months ago
2010
Springer
Potential maximal cliques and minimal separators are combinatorial objects which were introduced and studied in the realm of minimal triangulation problems including Minimum Fill-i...
CISS
2007
IEEE
15 years 4 months ago
2007
IEEE
— The problem of detecting encrypted information flows using timing information is considered. An information flow consists of both information-carrying packets and irrelevant ...