Sciweavers

84 search results - page 7 / 17
» Asymptotic enumeration of orientations
Sort
View
COMBINATORICS
2004
74views more  COMBINATORICS 2004»
13 years 7 months ago
Enumerative Problems Inspired by Mayer's Theory of Cluster Integrals
The basic functional equations for connected and 2-connnected graphs can be traced back to the statistical physicists Mayer and Husimi. They play an essential role in establishing...
Pierre Leroux
CSMR
2011
IEEE
12 years 11 months ago
Sub-graph Mining: Identifying Micro-architectures in Evolving Object-Oriented Software
Abstract—Developers introduce novel and undocumented micro-architectures when performing evolution tasks on object-oriented applications. We are interested in understanding wheth...
Ahmed Belderrar, Segla Kpodjedo, Yann-Gaël Gu...
WDAG
2000
Springer
112views Algorithms» more  WDAG 2000»
13 years 11 months ago
More Lower Bounds for Weak Sense of Direction: The Case of Regular Graphs
A graph G with n vertices and maximum degree G cannot be given weak sense of direction using less than G colours. It is known that n colours are always sufficient, and it was conje...
Paolo Boldi, Sebastiano Vigna
TROB
2002
105views more  TROB 2002»
13 years 7 months ago
Theoretical improvements in the stability analysis of a new class of model-free visual servoing methods
This paper concerns the stability analysis of a new class of model-free visual servoing methods. These methods are "model-free" since they are based on the estimation of ...
Ezio Malis, François Chaumette, Sylvie Boud...
VTC
2010
IEEE
166views Communications» more  VTC 2010»
13 years 6 months ago
On Capacity-Maximizing Angular Densities of Multipath in MIMO Channels
– This paper provides a partial answer to the question: "what is the best angular density of multipath in MIMO channels?" using the size-asymptotic theory of Toeplitz m...
George Levin, Sergey Loyka