Sciweavers

67 search results - page 10 / 14
» Decompositions of Natural Numbers: From a Case Study in Math...
Sort
View
FCCM
2007
IEEE
107views VLSI» more  FCCM 2007»
14 years 1 months ago
Optimizing Logarithmic Arithmetic on FPGAs
This paper proposes optimizations of the methods and parameters used in both mathematical approximation and hardware design for logarithmic number system (LNS) arithmetic. First, ...
Haohuan Fu, Oskar Mencer, Wayne Luk
EWSA
2006
Springer
13 years 11 months ago
On the Modular Representation of Architectural Aspects
An architectural aspect is a concern that cuts across architecture ty units and cannot be effectively modularized using the given abstractions of conventional Architecture Descript...
Alessandro Garcia, Christina Chavez, Thaís ...
CORR
2010
Springer
131views Education» more  CORR 2010»
13 years 6 months ago
Ideal forms of Coppersmith's theorem and Guruswami-Sudan list decoding
: We develop a framework for solving polynomial equations with size constraints on solutions. We obtain our results by showing how to apply a technique of Coppersmith for finding ...
Henry Cohn, Nadia Heninger
ECAL
2001
Springer
13 years 12 months ago
Amorphous Geometry
Amorphous computing is a recently introduced paradigm that favours geometrical configurations. The physical layout of an amorphous computer is based on a possibly irregular and er...
Ellie D'Hondt, Theo D'Hondt
ECCC
2008
122views more  ECCC 2008»
13 years 7 months ago
Every Minor-Closed Property of Sparse Graphs is Testable
Testing a property P of graphs in the bounded degree model is the following computational problem: given a graph G of bounded degree d we should distinguish (with probability 0.9,...
Itai Benjamini, Oded Schramm, Asaf Shapira