Sciweavers

2087 search results - page 28 / 418
» Computation of class numbers of quadratic number fields
Sort
View
FMCAD
2000
Springer
14 years 2 days ago
An Algorithm for Strongly Connected Component Analysis in n log n Symbolic Steps
We present a symbolic algorithm for strongly connected component decomposition. The algorithm performs (n log n) image and preimage computations in the worst case, where n is the n...
Roderick Bloem, Harold N. Gabow, Fabio Somenzi
CVPR
2007
IEEE
14 years 10 months ago
Solving Large Scale Binary Quadratic Problems: Spectral Methods vs. Semidefinite Programming
In this paper we introduce two new methods for solving binary quadratic problems. While spectral relaxation methods have been the workhorse subroutine for a wide variety of comput...
Carl Olsson, Anders P. Eriksson, Fredrik Kahl
CJ
2008
108views more  CJ 2008»
13 years 8 months ago
Computing with Time: From Neural Networks to Sensor Networks
This article advocates a new computing paradigm, called computing with time, that is capable of efficiently performing a certain class of computation, namely, searching in paralle...
Boleslaw K. Szymanski, Gilbert Chen
AMDO
2006
Springer
13 years 10 months ago
Interactive Soft Object Simulation with Quadratic Finite Elements
Abstract. We present a new method to simulate deformable volumetric objects interactively using finite elements. With quadratic basis functions and a non-linear strain tensor, we a...
Johannes Mezger, Wolfgang Straßer
AAECC
1993
Springer
170views Algorithms» more  AAECC 1993»
14 years 17 days ago
Exponential Sums as Discrete Fourier Transform with Invariant Phase Functions
We give estimates for exponential sums over finite fields in several variables. We study the case where the phase is either quadratic or more generally invariant under the action ...
Gilles Lachaud