2745 search results - page 308 / 549 » A fast algorithm for computing large Fibonacci numbers |
155
click to vote
ASPDAC
2010
ACM
15 years 3 months ago
2010
ACM
- Dynamic power consumption in CMOS circuits is usually estimated based on the number of signal transitions. However, when considering glitches, this is not accurate because narrow...
129
click to vote
GLOBECOM
2010
IEEE
15 years 3 months ago
2010
IEEE
Abstract--The information propagation speed (IPS) of a network specifies how fast the information can be transmitted in a network. In this paper, we derive an IPS upper bound in co...
185
click to vote
NAR
2011
14 years 8 months ago
2011
We present the relational database EDULISS (EDinburgh University Ligand Selection System), which stores structural, physicochemical and pharmacophoric properties of small molecule...
165
click to vote
KDD
2004
ACM
16 years 5 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 ...
159
click to vote
ALGORITHMICA
2005
15 years 5 months ago
2005
We present a new bit-parallel technique for approximate string matching. We build on two previous techniques. The first one, BPM [Myers, J. of the ACM, 1999], searches for a patte...