Sciweavers

11565 search results - page 269 / 2313
» Computing Minimal Mappings
Sort
View
CAD
2006
Springer
15 years 6 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
MICRO
2010
IEEE
149views Hardware» more  MICRO 2010»
15 years 4 months ago
ReMAP: A Reconfigurable Heterogeneous Multicore Architecture
This paper presents ReMAP, a reconfigurable architecture geared towards accelerating and parallelizing applications within a heterogeneous CMP. In ReMAP, threads share a common rec...
Matthew A. Watkins, David H. Albonesi
FCT
2009
Springer
16 years 23 days ago
Computing Role Assignments of Chordal Graphs
In social network theory, a simple graph G is called k-role assignable if there is a surjective mapping that assigns a number from {1, . . . , k} called a role to each vertex of G ...
Pim van 't Hof, Daniël Paulusma, Johan M. M. ...
CSJM
2006
81views more  CSJM 2006»
15 years 6 months ago
Nash equilibria set computing in finite extended games
The Nash equilibria set (NES) is described as an intersection of graphs of best response mappings. The problem of NES computing for multi-matrix extended games is considered. A me...
Valeriu Ungureanu
IWINAC
2007
Springer
16 years 10 days ago
Optimal Cue Combination for Saliency Computation: A Comparison with Human Vision
The computer model of visual attention derives an interest or saliency map from an input image in a process that encompasses several data combination steps. While several combinati...
Alexandre Bur, Heinz Hügli