Sciweavers

2853 search results - page 192 / 571
» On Coherence in Computer Algebra
Sort
View
121
Voted
ICALP
2004
Springer
15 years 10 months ago
An Analog Characterization of Elementarily Computable Functions over the Real Numbers
Abstract We present an analog and machine-independent algebraic characterization of elementarily computable functions over the real numbers in the sense of recursive analysis: we p...
Olivier Bournez, Emmanuel Hainry
139
Voted
ASPDAC
2006
ACM
127views Hardware» more  ASPDAC 2006»
15 years 10 months ago
Memory size computation for multimedia processing applications
– In real-time multimedia processing systems a very large part of the power consumption is due to the data storage and data transfer. Moreover, the area cost is often largely dom...
Hongwei Zhu, Ilie I. Luican, Florin Balasa
194
Voted
FOCS
1992
IEEE
15 years 8 months ago
Computing in Solvable Matrix Groups
We announce methods for e cient management of solvable matrix groups over nite elds. We show that solvability and nilpotence can be tested in polynomial-time. Such e ciency seems ...
Eugene M. Luks
ANTS
2010
Springer
216views Algorithms» more  ANTS 2010»
15 years 8 months ago
Efficient Pairing Computation with Theta Functions
In this paper, we present a new approach based on theta functions to compute Weil and Tate pairings. A benefit of our method, which does not rely on the classical Miller's alg...
David Lubicz, Damien Robert
MOC
2002
103views more  MOC 2002»
15 years 4 months ago
A computational approach to Hilbert modular group fixed points
Some useful information is known about the fundamental domain for certain Hilbert modular groups. The six nonequivalent points with nontrivial isotropy in the fundamental domains u...
Jesse Ira Deutsch