Sciweavers

299 search results - page 34 / 60
» Optimizing Polynomial Solvers for Minimal Geometry Problems
Sort
View
125
Voted
ASPDAC
2004
ACM
141views Hardware» more  ASPDAC 2004»
15 years 5 months ago
An approach for reducing dynamic power consumption in synchronous sequential digital designs
— The problem of minimizing dynamic power consumption by scaling down the supply voltage of computational elements off critical paths is widely addressed in the literature for th...
Noureddine Chabini, Wayne Wolf
113
Voted
COCOA
2009
Springer
15 years 7 months ago
Matching Techniques Ride to Rescue OLED Displays
Combinatorial optimization problems have recently emerged in the design of controllers for OLED displays. The objective is to decompose an image into subframes minimizing the addre...
Andreas Karrenbauer
77
Voted
ISBI
2007
IEEE
15 years 6 months ago
Autocorrecting Reconstruction for Flexible Ct Scanners
Nanotechnology researchers are developing miniature, lowpower x-ray devices. These innovations might revolutionize the world of computed tomography (CT). Tiny x-ray emitters and d...
Jeff Orchard, Alexei Ramotar
114
Voted
COMPGEOM
2006
ACM
15 years 6 months ago
Minimum weight triangulation is NP-hard
A triangulation of a planar point set S is a maximal plane straight-line graph with vertex set S. In the minimum weight triangulation (MWT) problem, we are looking for a triangula...
Wolfgang Mulzer, Günter Rote
94
Voted
ICAI
2007
15 years 1 months ago
Dynamic Programming Algorithm for Training Functional Networks
Abstract— The paper proposes a dynamic programming algorithm for training of functional networks. The algorithm considers each node as a state. The problem is formulated as find...
Emad A. El-Sebakhy, Salahadin Mohammed, Moustafa E...