Sciweavers

759 search results - page 137 / 152
» Optimal Graph Search with Iterated Graph Cuts
Sort
View
WABI
2007
Springer
15 years 3 months ago
Topology Independent Protein Structural Alignment
Abstract. Protein structural alignment is an indispensable tool used for many different studies in bioinformatics. Most structural alignment algorithms assume that the structural ...
Joe Dundas, T. Andrew Binkowski, Bhaskar DasGupta,...
ACMMSP
2004
ACM
101views Hardware» more  ACMMSP 2004»
15 years 3 months ago
Metrics and models for reordering transformations
Irregular applications frequently exhibit poor performance on contemporary computer architectures, in large part because of their inefficient use of the memory hierarchy. Runtime ...
Michelle Mills Strout, Paul D. Hovland
CRYPTO
2007
Springer
134views Cryptology» more  CRYPTO 2007»
15 years 3 months ago
Domain Extension of Public Random Functions: Beyond the Birthday Barrier
A public random function is a random function that is accessible by all parties, including the adversary. For example, a (public) random oracle is a public random function {0, 1}â...
Ueli M. Maurer, Stefano Tessaro
80
Voted
ICML
2010
IEEE
14 years 10 months ago
On the Consistency of Ranking Algorithms
We present a theoretical analysis of supervised ranking, providing necessary and sufficient conditions for the asymptotic consistency of algorithms based on minimizing a surrogate...
John Duchi, Lester W. Mackey, Michael I. Jordan
ICDE
2012
IEEE
240views Database» more  ICDE 2012»
13 years 2 days ago
Approximate Shortest Distance Computing: A Query-Dependent Local Landmark Scheme
—Shortest distance query between two nodes is a fundamental operation in large-scale networks. Most existing methods in the literature take a landmark embedding approach, which s...
Miao Qiao, Hong Cheng, Lijun Chang, Jeffrey Xu Yu