Sciweavers

19866 search results - page 405 / 3974
» Computing all factorizations in ***
Sort
View
CAD
2006
Springer
15 years 7 months ago
Fast computation of inertia through affinely extended Euler tensor
We introduce an affine extension of the Euler tensor which encompasses all of the inertia properties of interest in a convenient linear format, and we show how it transforms under...
Antonio DiCarlo, Alberto Paoluzzi
SIGCSE
2002
ACM
88views Education» more  SIGCSE 2002»
15 years 6 months ago
Teaching computer organization/architecture with limited resources using simulators
As the complexity and variety of computer system hardware increases, its suitability as a pedagogical tool in computer organization/architecture courses diminishes. As a consequen...
Gregory S. Wolffe, William Yurcik, Hugh Osborne, M...
ICPR
2008
IEEE
16 years 8 months ago
Force histograms computed in O(NlogN)
The relative position between two objects in a 2D raster image is often represented quantitatively by a force histogram. In the general case, force histograms are computed in O(KN...
JingBo Ni, Pascal Matsakis
POPL
2007
ACM
16 years 7 months ago
A proposal for parallel self-adjusting computation
We present an overview of our ongoing work on parallelizing self-adjusting-computation techniques. In self-adjusting computation, programs can respond to changes to their data (e....
Matthew Hammer, Umut A. Acar, Mohan Rajagopalan, A...
DCC
2007
IEEE
16 years 6 months ago
Efficient pairing computation on supersingular Abelian varieties
Abstract. We present a general technique for the efficient computation of pairings on supersingular Abelian varieties. This formulation, which we call the eta pairing, generalises ...
Paulo S. L. M. Barreto, Steven D. Galbraith, Colm ...