Sciweavers

224 search results - page 30 / 45
» Homogeneous Decomposition of Polynomials
Sort
View
ASPDAC
2009
ACM
143views Hardware» more  ASPDAC 2009»
14 years 4 months ago
Statistical modeling and analysis of chip-level leakage power by spectral stochastic method
In this paper, we present a novel statistical full-chip leakage power analysis method. The new method can provide a general framework to derive the full-chip leakage current or po...
Ruijing Shen, Ning Mi, Sheldon X.-D. Tan, Yici Cai...
ISAAC
2005
Springer
123views Algorithms» more  ISAAC 2005»
14 years 3 months ago
Sampling Unlabeled Biconnected Planar Graphs
We present an expected polynomial time algorithm to generate a 2-connected unlabeled planar graph uniformly at random. To do this we first derive recurrence formulas to count the ...
Manuel Bodirsky, Clemens Gröpl, Mihyun Kang
MA
2010
Springer
150views Communications» more  MA 2010»
13 years 4 months ago
Cokriging for spatial functional data
This work proposes to generalize the method of cokriging when data are spatially sampled curves. A spatial functional linear model is constructed including spatial dependencies be...
David Nerini, Pascal Monestiez, Claude Manté...
COMPGEOM
2003
ACM
14 years 3 months ago
Molecular shape analysis based upon the morse-smale complex and the connolly function
Docking is the process by which two or several molecules form a complex. Docking involves the geometry of the molecular surfaces, as well as chemical and energetical consideration...
Frédéric Cazals, Frédé...
WAOA
2005
Springer
177views Algorithms» more  WAOA 2005»
14 years 3 months ago
Approximation and Complexity of k-Splittable Flows
Given a graph with a source and a sink node, the NP–hard maximum k–splittable flow (MkSF) problem is to find a flow of maximum value with a flow decomposition using at most...
Ronald Koch, Martin Skutella, Ines Spenke