Sciweavers

4488 search results - page 302 / 898
» Properties of NP-Complete Sets
Sort
View
APPROX
2010
Springer
135views Algorithms» more  APPROX 2010»
15 years 7 months ago
Monotonicity Testing and Shortest-Path Routing on the Cube
We study the problem of monotonicity testing over the hypercube. As previously observed in several works, a positive answer to a natural question about routing properties of the hy...
Jop Briët, Sourav Chakraborty, David Garc&iac...
140
Voted
ICASSP
2010
IEEE
15 years 7 months ago
Morphological wavelets and the complexity of dyadic trees
In this paper we reveal a connection between the coefficients of the morphological wavelet transform and complexity measures of dyadic tree representations of level sets. This le...
Zhen James Xiang, Peter J. Ramadge
ICPR
2010
IEEE
15 years 7 months ago
Connected Component Trees for Multivariate Image Processing and Applications in Astronomy
In this paper, we investigate the possibilities offered by the extension of the connected component trees (cc-trees) to multivariate images. We propose a general framework for ima...
Benjamin Perret, Sébastien Lefèvre, ...
177
Voted
AUTOMATICA
2010
130views more  AUTOMATICA 2010»
15 years 7 months ago
Discrete-time dynamic average consensus
We propose a class of discrete-time dynamic average consensus algorithms that allow a group of agents to track the average of their reference inputs. The convergence results rely ...
Minghui Zhu, Sonia Martínez
186
Voted
ARSCOM
2007
191views more  ARSCOM 2007»
15 years 7 months ago
Binomial Identities Generated by Counting Spanning Trees
We partition the set of spanning trees contained in the complete graph Kn into spanning trees contained in the complete bipartite graph Ks,t. This relation will show that any prop...
Thomas Dale Porter