Sciweavers

2570 search results - page 140 / 514
» Fast Algorithms For The Computation Of Ranklets
Sort
View
116
Voted
ISSAC
2009
Springer
163views Mathematics» more  ISSAC 2009»
15 years 10 months ago
Fast arithmetics in artin-schreier towers over finite fields
An Artin-Schreier tower over the finite field Fp is a tower of field extensions generated by polynomials of the form Xp − X − α. Following Cantor and Couveignes, we give a...
Luca De Feo, Éric Schost
135
Voted
DSD
2003
IEEE
142views Hardware» more  DSD 2003»
15 years 8 months ago
FC-Min: A Fast Multi-Output Boolean Minimizer
We present a novel heuristic algorithm for two-level Boolean minimization. In contrast to the other approaches, the proposed method firstly finds the coverage of the on-sets and f...
Petr Fiser, Jan Hlavicka, Hana Kubatova
WSCG
2004
159views more  WSCG 2004»
15 years 4 months ago
A Fast Method for Applying Rigid Transformations to Volume Data
Volume rendering is a widespread method for displaying graphical models in fields such as medical visualization or engineering. The required image information is stored in a volum...
Jan Fischer, Ángel del Río
ICCAD
2008
IEEE
150views Hardware» more  ICCAD 2008»
16 years 7 days ago
Performance estimation and slack matching for pipelined asynchronous architectures with choice
— This paper presents a fast analytical method for estimating the throughput of pipelined asynchronous systems, and then applies that method to develop a fast solution to the pro...
Gennette Gill, Vishal Gupta, Montek Singh
ICCV
2003
IEEE
16 years 5 months ago
Fast Pose Estimation with Parameter-Sensitive Hashing
Example-based methods are effective for parameter estimation problems when the underlying system is simple or the dimensionality of the input is low. For complex and high-dimensio...
Gregory Shakhnarovich, Paul A. Viola, Trevor Darre...