95 search results - page 16 / 19 » Asymptotic analysis of finite difference methods |
IJCAI
1989
13 years 11 months ago
1989
gn problem can be abstractly characterized as a constrained function-to-structure mapping. The de sign task takes as input the specifications of the desired functions of a device...
BMCBI
2007
13 years 10 months ago
2007
Background: Finding over- or under-represented motifs in biological sequences is now a common task in genomics. Thanks to p-value calculation for motif counts, exceptional motifs ...
CDC
2008
IEEE
14 years 4 months ago
2008
IEEE
Abstract— We relax the monotonicity requirement of Lyapunov’s theorem to enlarge the class of functions that can provide certificates of stability. To this end, we propose two...
ICC
2007
IEEE
14 years 4 months ago
2007
IEEE
—Opportunistic scheduling in random beamforming maximizes the sum-rate by allocating resources to the users with the best channel condition, thus leveraging on multiuser diversit...
CSDA
2007
13 years 9 months ago
2007
A fast algorithm for calculating the simplicial depth of a single parameter vector of a polynomial regression model is derived. Additionally, an algorithm for calculating the para...