Sciweavers

779 search results - page 64 / 156
» Algorithms for the Sample Mean of Graphs
Sort
View
ASPDAC
2005
ACM
104views Hardware» more  ASPDAC 2005»
15 years 6 months ago
On multiple-voltage high-level synthesis using algorithmic transformations
— This paper presents a multiple-voltage high-level synthesis methodology for low power DSP applications using algorithmic transformation techniques. Our approach is motivated by...
Hsueh-Chih Yang, Lan-Rong Dung
CDC
2009
IEEE
161views Control Systems» more  CDC 2009»
15 years 9 months ago
Consensus on homogeneous manifolds
Abstract— The present paper considers distributed consensus algorithms for agents evolving on a connected compact homogeneous (CCH) manifold. The agents track no external referen...
Alain Sarlette, Rodolphe Sepulchre
CSMR
1999
IEEE
15 years 8 months ago
Impact of Function Pointers on the Call Graph
Maintenance activities are made more difficult when pointers are heavily used in source code: the programmer needs to build a mental model of memory locations and of the way they ...
Giuliano Antoniol, F. Calzolari, Paolo Tonella
PR
2006
113views more  PR 2006»
15 years 4 months ago
Face recognition from a single image per person: A survey
One of the main challenges faced by the current face recognition techniques lies in the difficulties of collecting samples. Fewer samples per person mean less laborious effort for...
Xiaoyang Tan, Songcan Chen, Zhi-Hua Zhou, Fuyan Zh...
COMBINATORICS
2000
114views more  COMBINATORICS 2000»
15 years 4 months ago
Trees and Matchings
In this article, Temperley's bijection between spanning trees of the square grid on the one hand, and perfect matchings (also known as dimer coverings) of the square grid on ...
Richard Kenyon, James Gary Propp, David Bruce Wils...