Sciweavers

236 search results - page 5 / 48
» Real Complex Reconfigurable Arithmetic Using Redundant Compl...
Sort
View
CIE
2005
Springer
14 years 1 months ago
Formalising Exact Arithmetic in Type Theory
In this work we focus on a formalisation of the algorithms of lazy exact arithmetic `a la Potts and Edalat [1]. We choose the constructive type theory as our formal verification t...
Milad Niqui
MST
2007
168views more  MST 2007»
13 years 7 months ago
Productivity of Edalat-Potts Exact Arithmetic in Constructive Type Theory
In this work we focus on a formalisation of the algorithms of lazy exact arithmetic `a la Edalat–Potts in type theory. We choose the constructive type theory extended with coind...
Milad Niqui
EDBT
2010
ACM
155views Database» more  EDBT 2010»
14 years 2 months ago
Reducing metadata complexity for faster table summarization
Since the visualization real estate puts stringent constraints on how much data can be presented to the users at once, table summarization is an essential tool in helping users qu...
K. Selçuk Candan, Mario Cataldi, Maria Luis...
ISAAC
2003
Springer
141views Algorithms» more  ISAAC 2003»
14 years 27 days ago
Quasi-optimal Arithmetic for Quaternion Polynomials
Abstract. Fast algorithms for arithmetic on real or complex polynomials are wellknown and have proven to be not only asymptotically efficient but also very practical. Based on Fas...
Martin Ziegler
ICRA
2002
IEEE
86views Robotics» more  ICRA 2002»
14 years 19 days ago
Optimized Binary Modular Reconfigurable Robotic Devices
—Binary robotic devices with large degrees of freedom have been proposed by a number of researchers. However, experimental implementations of these concepts have been built with ...
Moustapha Hafez, Matthew D. Lichter, Steven Dubows...