1449 search results - page 229 / 290 » Self-Randomized Exponentiation Algorithms |
140
click to vote
DAC
2003
ACM
16 years 7 months ago
2003
ACM
Cyclic circuits that do not hold state or oscillate are often the most convenient representation for certain functions, such as arbiters, and can easily be produced inadvertently ...
188
click to vote
KDD
2004
ACM
16 years 6 months ago
2004
ACM
One fundamental challenge for mining recurring subgraphs from semi-structured data sets is the overwhelming abundance of such patterns. In large graph databases, the total number ...
167
click to vote
RECOMB
2005
Springer
16 years 6 months ago
2005
Springer
Abstract. In this paper, we study lower bound techniques for branchand-bound algorithms for maximum parsimony, with a focus on gene order data. We give a simple O(n3 ) time dynamic...
192
click to vote
STACS
2010
Springer
16 years 1 months ago
2010
Springer
Abstract. The problem of Subgraph Isomorphism is defined as follows: Given a pattern H and a host graph G on n vertices, does G contain a subgraph that is isomorphic to H? Eppstei...
134
click to vote
ICASSP
2009
IEEE
16 years 23 days ago
2009
IEEE
Due to their computational efficiency and strong empirical performance, semidefinite relaxation (SDR)–based algorithms have gained much attention in multiple–input multiple...