Sciweavers

12697 search results - page 2482 / 2540
» Call for Papers
Sort
View
SIAMAM
2000
90views more  SIAMAM 2000»
13 years 7 months ago
Local Strong Homogeneity of a Regularized Estimator
This paper deals with regularized pointwise estimation of discrete signals which contain large strongly homogeneous zones, where typically they are constant, or linear, or more gen...
Mila Nikolova
IJAR
2002
102views more  IJAR 2002»
13 years 7 months ago
Networks of probabilistic events in discrete time
The usual methods of applying Bayesian networks to the modeling of temporal processes, such as Dean and Kanazawa's dynamic Bayesian networks (DBNs), consist in discretizing t...
Severino F. Galán, Francisco Javier D&iacut...
COMCOM
1998
102views more  COMCOM 1998»
13 years 7 months ago
Preferred link based delay-constrained least-cost routing in wide area networks
Multimedia applications involving digital audio and/or digital video transmissions require strict QoS constraints (end-to-end delay bound, bandwidth availability, packet loss rate...
R. Sriram, Govindarasu Manimaran, C. Siva Ram Murt...
INFSOF
2002
147views more  INFSOF 2002»
13 years 7 months ago
On the efficiency of domain-based COTS product selection method
Use of commercial-off-the-shelf (COTS) products is becoming a popular software development method. Current methods of selecting COTS products involve using the intuition of softwa...
Karl R. P. H. Leung, Hareton K. N. Leung
IPL
2002
125views more  IPL 2002»
13 years 7 months ago
A note concerning the closest point pair algorithm
An algorithm, described by Sedgewick, finds the distance between the closest pair of n given points in a plane using a variant of mergesort. This takes O(n log n) time. To prove t...
Martin Richards
« Prev « First page 2482 / 2540 Last » Next »