Sciweavers

6142 search results - page 75 / 1229
» The Complexity of Partition Functions
Sort
View
RSA
2010
118views more  RSA 2010»
14 years 8 months ago
Weight of a link in a shortest path tree and the Dedekind Eta function
The weight of a randomly chosen link in the shortest path tree on the complete graph with exponential i.i.d. link weights is studied. The corresponding exact probability generatin...
Piet Van Mieghem
ASPDAC
2000
ACM
117views Hardware» more  ASPDAC 2000»
15 years 2 months ago
Improved algorithms for hypergraph bipartitioning
Multilevel Fiduccia-Mattheyses MLFM hypergraph partitioning 3, 22, 24 is a fundamental optimization in VLSI CAD physical design. The leading implementation, hMetis 23 , has sinc...
Andrew E. Caldwell, Andrew B. Kahng, Igor L. Marko...
USENIX
2000
14 years 11 months ago
Dynamic Function Placement for Data-Intensive Cluster Computing
Optimally partitioning application and filesystem functionality within a cluster of clients and servers is a difficult problem due to dynamic variations in application behavior, r...
Khalil Amiri, David Petrou, Gregory R. Ganger, Gar...
CORR
2010
Springer
103views Education» more  CORR 2010»
14 years 10 months ago
Exploratory Analysis of Functional Data via Clustering and Optimal Segmentation
We propose in this paper an exploratory analysis algorithm for functional data. The method partitions a set of functions into K clusters and represents each cluster by a simple pr...
Georges Hébrail, Bernard Hugueney, Yves Lec...
CDC
2008
IEEE
239views Control Systems» more  CDC 2008»
15 years 4 months ago
Construction of Lyapunov-Krasovskii functional for time-varying delay systems
This paper provides some new techniques to construct a LyapunovKrasovskii functional for time varying delay systems. The construction is based on a partitioning scheme of the time...
Yassine Ariba, Frédéric Gouaisbaut