Sciweavers

1487 search results - page 265 / 298
» The Computational Complexity of Link Building
Sort
View
ALGORITHMICA
2005
195views more  ALGORITHMICA 2005»
13 years 8 months ago
Bit-Parallel Witnesses and Their Applications to Approximate String Matching
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...
Heikki Hyyrö, Gonzalo Navarro
JCNS
2000
165views more  JCNS 2000»
13 years 8 months ago
A Population Density Approach That Facilitates Large-Scale Modeling of Neural Networks: Analysis and an Application to Orientati
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 ...
Duane Q. Nykamp, Daniel Tranchina
CLUSTER
2011
IEEE
12 years 8 months ago
Performance Characterization and Optimization of Atomic Operations on AMD GPUs
—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...
Marwa Elteir, Heshan Lin, Wu-chun Feng
IACR
2011
111views more  IACR 2011»
12 years 8 months ago
Secure Multi-Party Sorting and Applications
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...
Kristján Valur Jónsson, Gunnar Kreit...
MOBISYS
2009
ACM
14 years 9 months ago
Longitudinal study of a building-scale RFID ecosystem
Radio Frequency IDentification (RFID) deployments are becoming increasingly popular in both industrial and consumer-oriented settings. To effectively exploit and operate such depl...
Evan Welbourne, Karl Koscher, Emad Soroush, Magdal...