Sciweavers

1523 search results - page 263 / 305
» The Computational Complexity of Linear Optics
Sort
View
COMPGEOM
1993
ACM
13 years 11 months ago
Approximating Center Points with Iterated Radon Points
We give a practical and provably good Monte Carlo algorithm for approximating center points. Let P be a set of n points in IRd . A point c ∈ IRd is a β-center point of P if eve...
Kenneth L. Clarkson, David Eppstein, Gary L. Mille...
CASES
2007
ACM
13 years 11 months ago
Application driven embedded system design: a face recognition case study
The key to increasing performance without a commensurate increase in power consumption in modern processors lies in increasing both parallelism and core specialization. Core speci...
Karthik Ramani, Al Davis
GLVLSI
2009
IEEE
172views VLSI» more  GLVLSI 2009»
13 years 11 months ago
Contact merging algorithm for efficient substrate noise analysis in large scale circuits
A methodology is proposed to efficiently estimate the substrate noise generated by large scale aggressor circuits. Small spatial voltage differences within the ground distribution...
Emre Salman, Renatas Jakushokas, Eby G. Friedman, ...
3DPVT
2004
IEEE
136views Visualization» more  3DPVT 2004»
13 years 11 months ago
A Unified Representation for Interactive 3D Modeling
Interactive 3D modeling is the process of building a 3D model of an object or a scene in real-time while the 3D (range) data is acquired. This is possible only if the computationa...
Dragan Tubic, Patrick Hébert, Jean-Daniel D...
FPL
2004
Springer
100views Hardware» more  FPL 2004»
13 years 11 months ago
On Optimal Irregular Switch Box Designs
In this paper, we develop a unified theory in analyzing optimal switch box design problems, particularly for the unsolved irregular cases, where different pin counts are allowed on...
Hongbing Fan, Yu-Liang Wu, Chak-Chung Cheung, Jipi...