2157 search results - page 122 / 432 » Optimal Fast Hashing |
137
Voted
NIPS
2008
15 years 6 months ago
2008
We study convergence properties of empirical minimization of a stochastic strongly convex objective, where the stochastic component is linear. We show that the value attained by t...
124
click to vote
OPODIS
2008
15 years 6 months ago
2008
We present a concurrent face routing CFR algorithm. We formally prove that the worst case latency of our algorithm is asymptotically optimal. Our simulation results demonstrate tha...
142
click to vote
RSS
2007
15 years 6 months ago
2007
— We present an efficient algorithm to compute the generalized penetration depth (PDg) between rigid models. Given two overlapping objects, our algorithm attempts to compute the...
141
click to vote
SODA
1998
ACM
15 years 5 months ago
1998
ACM
We develop data structures for dynamic closest pair problems with arbitrary (not necessarily geometric) distance functions, based on a technique previously used by the author for ...
132
click to vote
BMCBI
2008
15 years 4 months ago
2008
Background: Protein structure comparison is a key problem in bioinformatics. There exist several methods for doing protein comparison, being the solution of the Maximum Contact Ma...