Sciweavers

18306 search results - page 454 / 3662
» Algorithmics in Exponential Time
Sort
View
ICCAD
2007
IEEE
115views Hardware» more  ICCAD 2007»
16 years 4 months ago
Timing optimization by restructuring long combinatorial paths
—We present an implementation of an algorithm for constructing provably fast circuits for a class of Boolean functions with input signals that have individual starting times. We ...
Jürgen Werber, Dieter Rautenbach, Christian S...
PKC
2007
Springer
165views Cryptology» more  PKC 2007»
16 years 1 months ago
Deterministic Polynomial Time Equivalence Between Factoring and Key-Recovery Attack on Takagi's RSA
Abstract. For RSA, May showed a deterministic polynomial time equivalence of computing d to factoring N(= pq). On the other hand, Takagi showed a variant of RSA such that the decry...
Noboru Kunihiro, Kaoru Kurosawa
WECWIS
2005
IEEE
121views ECommerce» more  WECWIS 2005»
16 years 1 months ago
Matching Composed Semantic Web Services at Publishing Time
This paper describes an algorithm optimizing the discovery process for composed semantic web services. The algorithm can be used to improve discovery of appropriate component servi...
Andreas Friesen, Michael Altenhofen
AAAI
2007
15 years 10 months ago
UNDERTOW: Multi-Level Segmentation of Real-Valued Time Series
The discovery of meaningful change points, finding segments, in both categorical and real-value data time series is a well-studied problem. Prior segmentation algorithms and task...
Tom Armstrong, Tim Oates
STACS
2007
Springer
16 years 1 months ago
New Approximation Algorithms for Minimum Cycle Bases of Graphs
We consider the problem of computing an approximate minimum cycle basis of an undirected non-negative edge-weighted graph G with m edges and n vertices; the extension to directed ...
Telikepalli Kavitha, Kurt Mehlhorn, Dimitrios Mich...