1487 search results - page 265 / 298 » The Computational Complexity of Link Building |
107
click to vote
ALGORITHMICA
2005
14 years 11 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...
118
click to vote
JCNS
2000
14 years 11 months ago
2000
We explore a computationally efficient method of simulating realistic networks of neurons introduced by Knight, Manin, and Sirovich (1996) in which integrate-and-fire neurons are ...
105
click to vote
CLUSTER
2011
IEEE
13 years 11 months ago
2011
IEEE
—Atomic operations are important building blocks in supporting general-purpose computing on graphics processing units (GPUs). For instance, they can be used to coordinate executi...
112
click to vote
IACR
2011
13 years 11 months ago
2011
Sorting is among the most fundamental and well-studied problems within computer science and a core step of many algorithms. In this article, we consider the problem of constructing...
106
Voted
MOBISYS
2009
ACM
16 years 9 days ago
2009
ACM
Radio Frequency IDentification (RFID) deployments are becoming increasingly popular in both industrial and consumer-oriented settings. To effectively exploit and operate such depl...