Sciweavers

ANTS
2000
Springer
117views Algorithms» more  ANTS 2000»
14 years 4 months ago
Modular Forms for GL(3) and Galois Representations
Abstract. A description and an example are given of numerical experiments which look for a relation between modular forms for certain congruence subgroups of SL(3, ZZ) and Galois r...
Bert van Geemen, Jaap Top
ANTS
2000
Springer
92views Algorithms» more  ANTS 2000»
14 years 4 months ago
Computing Special Values of Partial Zeta Functions
We discuss computation of the special values of partial zeta functions associated to totally real number fields. The main tool is the Eisenstein cocycle Ψ, a group cocycle for GL...
Gautam Chinta, Paul E. Gunnells, Robert Sczech
ANTS
2000
Springer
96views Algorithms» more  ANTS 2000»
14 years 4 months ago
Coverings of Curves of Genus 2
We shall discuss the idea of finding all rational points on a curve C by first finding an associated collection of curves whose rational points cover those of C. This classical ...
E. Victor Flynn
ANTS
2000
Springer
133views Algorithms» more  ANTS 2000»
14 years 4 months ago
Lifting Elliptic Curves and Solving the Elliptic Curve Discrete Logarithm Problem
Abstract. Essentially all subexponential time algorithms for the discrete logarithm problem over nite elds are based on the index calculus idea. In proposing cryptosystems based on...
Ming-Deh A. Huang, Ka Lam Kueh, Ki-Seng Tan
ADBIS
2000
Springer
188views Database» more  ADBIS 2000»
14 years 4 months ago
Algorithms for Rewriting Aggregate Queries Using Views
Queries involving aggregation are typical in a number of database research areas, such as data warehousing, global information systems and mobile computing. One of the main ideas ...
Sara Cohen, Werner Nutt, Alexander Serebrenik
VRST
2000
ACM
14 years 4 months ago
Fast perception-based depth of field rendering
Current algorithms to create depth of field (DOF) effects are either too costly to be applied in VR systems, or they produce inaccurate results. In this paper, we present a new a...
Jurriaan D. Mulder, Robert van Liere
STOC
2000
ACM
137views Algorithms» more  STOC 2000»
14 years 4 months ago
Approximate nearest neighbors and sequence comparison with block operations
S. Muthukrishnan, Süleyman Cenk Sahinalp
STOC
2000
ACM
156views Algorithms» more  STOC 2000»
14 years 4 months ago
Near optimal multiple alignment within a band in polynomial time
Multiple sequence alignment is a fundamental problem in computational biology. Because of its notorious difficulties, aligning sequences within a constant band (c-diagonal) is a ...
Ming Li, Bin Ma, Lusheng Wang