Sciweavers

11345 search results - page 1761 / 2269
» Foundations of Computer Science
Sort
View
173
Voted
ACMSE
2006
ACM
15 years 8 months ago
Achieving efficient polynomial multiplication in fermat fields using the fast Fourier transform
We introduce an efficient way of performing polynomial multiplication in a class of finite fields GF(pm ) in the frequency domain. The Fast Fourier Transform (FFT) based frequency...
Selçuk Baktir, Berk Sunar
CSB
2004
IEEE
177views Bioinformatics» more  CSB 2004»
15 years 8 months ago
High-Throughput 3D Structural Homology Detection via NMR Resonance Assignment
One goal of the structural genomics initiative is the identification of new protein folds. Sequence-based structural homology prediction methods are an important means for priorit...
Christopher James Langmead, Bruce Randall Donald
149
Voted
CSCW
2004
ACM
15 years 8 months ago
Putting systems into place: a qualitative study of design requirements for location-aware community systems
We present a conceptual framework for location-aware community systems and results from two studies of how sociallydefined places influence people's information sharing and c...
Quentin Jones, Sukeshini A. Grandhi, Steve Whittak...
153
Voted
FOCS
2004
IEEE
15 years 8 months ago
Approximating Edit Distance Efficiently
Edit distance has been extensively studied for the past several years. Nevertheless, no linear-time algorithm is known to compute the edit distance between two strings, or even to...
Ziv Bar-Yossef, T. S. Jayram, Robert Krauthgamer, ...
198
Voted
FOCS
2004
IEEE
15 years 8 months ago
Tolls for Heterogeneous Selfish Users in Multicommodity Networks and Generalized Congestion Games
We prove the existence of tolls to induce multicommodity, heterogeneous network users that independently choose routes minimizing their own linear function of tolls versus latency...
Lisa Fleischer, Kamal Jain, Mohammad Mahdian
« Prev « First page 1761 / 2269 Last » Next »