Sciweavers

6365 search results - page 367 / 1273
» Fast Local Computation Algorithms
Sort
View
CAD
2010
Springer
15 years 6 months ago
Feature aligned quad dominant remeshing using iterative local updates
In this paper we present a new algorithm which turns an unstructured triangle mesh into a quad-dominant mesh with edges well aligned to the principal directions of the underlying ...
Yu-Kun Lai, Leif Kobbelt, Shi-Min Hu
CVPR
2008
IEEE
16 years 8 months ago
Boosting ordinal features for accurate and fast iris recognition
In this paper, we present a novel iris recognition method based on learned ordinal features.Firstly, taking full advantages of the properties of iris textures, a new iris represen...
Zhaofeng He, Zhenan Sun, Tieniu Tan, Xianchao Qiu,...
ICCAD
2001
IEEE
111views Hardware» more  ICCAD 2001»
16 years 3 months ago
A Trajectory Piecewise-Linear Approach to Model Order Reduction and Fast Simulation of Nonlinear Circuits and Micromachined Devi
—In this paper, we present an approach to nonlinear model reduction based on representing a nonlinear system with a piecewise-linear system and then reducing each of the pieces w...
Michal Rewienski, Jacob White
SIGCOMM
2009
ACM
16 years 1 months ago
Building a fast, virtualized data plane with programmable hardware
Network virtualization allows many networks to share the same underlying physical topology; this technology has offered promise both for experimentation and for hosting multiple n...
Muhammad Bilal Anwer, Nick Feamster
FCCM
2002
IEEE
127views VLSI» more  FCCM 2002»
15 years 11 months ago
Hardware-Assisted Fast Routing
To fully realize the benefits of partial and rapid reconfiguration of field-programmable devices, we often need to dynamically schedule computing tasks and generate instance-sp...
André DeHon, Randy Huang, John Wawrzynek