Sciweavers

3068 search results - page 148 / 614
» Clustering with Multiple Graphs
Sort
View
CDC
2008
IEEE
192views Control Systems» more  CDC 2008»
15 years 8 months ago
Distributed coordination algorithms for multiple fractional-order systems
Abstract-- This paper studies distributed coordination algorithms for multiple fractional-order systems over a directed communication graph. A general fractional-order consensus mo...
Yongcan Cao, Yan Li, Wei Ren, Yangquan Chen
ESA
2006
Springer
105views Algorithms» more  ESA 2006»
15 years 10 months ago
Dynamic Programming and Fast Matrix Multiplication
Abstract. We give a novel general approach for solving NP-hard optimization problems that combines dynamic programming and fast matrix multiplication. The technique is based on red...
Frederic Dorn
CORR
2011
Springer
174views Education» more  CORR 2011»
15 years 1 months ago
Termination Proofs in the Dependency Pair Framework May Induce Multiple Recursive Derivational Complexity
We study the complexity of rewrite systems shown terminating via the dependency pair framework using processors for reduction pairs, dependency graphs, or the subterm criterion. T...
Georg Moser, Andreas Schnabl
ESOA
2006
15 years 10 months ago
Dynamic Decentralized Any-Time Hierarchical Clustering
Hierarchical clustering is used widely to organize data and search for patterns. Previous algorithms assume that the body of data being clustered is fixed while the algorithm runs...
H. Van Dyke Parunak, Richard Rohwer, Theodore C. B...
LPAR
2007
Springer
16 years 17 days ago
Retractile Proof Nets of the Purely Multiplicative and Additive Fragment of Linear Logic
Proof nets are a parallel syntax for sequential proofs of linear logic, firstly introduced by Girard in 1987. Here we present and intrinsic (geometrical) characterization of proof...
Roberto Maieli