Sciweavers

2487 search results - page 161 / 498
» Partitions of Graphs into Trees
Sort
View
153
Voted
MICS
2010
134views more  MICS 2010»
15 years 2 months ago
Scale Free Properties of Random k-Trees
Scale free graphs have attracted attention as their non-uniform structure that can be used as a model for many social networks including the WWW and the Internet. In this paper, w...
Colin Cooper, Ryuhei Uehara
MLDM
2005
Springer
15 years 9 months ago
Supervised Evaluation of Dataset Partitions: Advantages and Practice
In the context of large databases, data preparation takes a greater importance : instances and explanatory attributes have to be carefully selected. In supervised learning, instanc...
Sylvain Ferrandiz, Marc Boullé
135
Voted
IPPS
2010
IEEE
15 years 1 months ago
Adapting cache partitioning algorithms to pseudo-LRU replacement policies
Abstract-- Recent studies have shown that cache partitioning is an efficient technique to improve throughput, fairness and Quality of Service (QoS) in CMP processors. The cache par...
Kamil Kedzierski, Miquel Moretó, Francisco ...
105
Voted
BIRTHDAY
2009
Springer
15 years 10 months ago
The Weak Gap Property in Metric Spaces of Bounded Doubling Dimension
We introduce the weak gap property for directed graphs whose vertex set S is a metric space of size n. We prove that, if the doubling dimension of S is a constant, any directed gra...
Michiel H. M. Smid
83
Voted
CDC
2008
IEEE
105views Control Systems» more  CDC 2008»
15 years 10 months ago
On the stability of distance-based formation control
— This paper examines stability properties of distance-based formations. These are formations encoded by inter-agent relative distances. A negative gradient control law is propos...
Dimos V. Dimarogonas, Karl Henrik Johansson