762 search results - page 128 / 153 » Finding Facilities Fast |
204
click to vote
HPCA
1998
IEEE
15 years 10 months ago
1998
IEEE
Good network hardware performance is often squandered by overheads for accessing the network interface (NI) within a host. NIs that support user-level messaging avoid frequent ope...
184
click to vote
BTW
2007
Springer
15 years 10 months ago
2007
Springer
: The reverse k-nearest neighbor (RkNN) problem, i.e. finding all objects in a data set the k-nearest neighbors of which include a specified query object, has received increasing a...
162
click to vote
ALENEX
2010
15 years 7 months ago
2010
Previously [SODA'04] we devised the fastest known algorithm for 4-universal hashing. The hashing was based on small pre-computed 4-universal tables. This led to a five-fold i...
155
click to vote
ALMOB
2008
15 years 6 months ago
2008
Background: Protein structure alignments are usually based on very different techniques to sequence alignments. We propose a method which treats sequence, structure and even combi...
202
click to vote
ALMOB
2006
15 years 6 months ago
2006
This editorial announces Algorithms for Molecular Biology, a new online open access journal published by BioMed Central. By launching the first open access journal on algorithmic ...