Sciweavers

2631 search results - page 152 / 527
» A Practical Method for the Sparse Resultant
Sort
View
ALGORITHMICA
1998
73views more  ALGORITHMICA 1998»
15 years 6 months ago
Linear Probing and Graphs
Mallows and Riordan showed in 1968 that labeled trees with a small number of inversions are related to labeled graphs that are connected and sparse. Wright enumerated sparse connec...
Donald E. Knuth
JSS
2007
118views more  JSS 2007»
15 years 6 months ago
A new imputation method for small software project data sets
Effort prediction is a very important issue for software project management. Historical project data sets are frequently used to support such prediction. But missing data are oft...
Qinbao Song, Martin J. Shepperd
GLVLSI
2008
IEEE
129views VLSI» more  GLVLSI 2008»
16 years 24 days ago
Variational capacitance modeling using orthogonal polynomial method
In this paper, we propose a novel statistical capacitance extraction method for interconnects considering process variations. The new method, called statCap, is based on the spect...
Jian Cui, Gengsheng Chen, Ruijing Shen, Sheldon X....
COCOS
2003
Springer
148views Optimization» more  COCOS 2003»
15 years 11 months ago
Convex Programming Methods for Global Optimization
We investigate some approaches to solving nonconvex global optimization problems by convex nonlinear programming methods. We assume that the problem becomes convex when selected va...
John N. Hooker
JAIR
2002
163views more  JAIR 2002»
15 years 6 months ago
Efficient Reinforcement Learning Using Recursive Least-Squares Methods
The recursive least-squares (RLS) algorithm is one of the most well-known algorithms used in adaptive filtering, system identification and adaptive control. Its popularity is main...
Xin Xu, Hangen He, Dewen Hu