Sciweavers

3270 search results - page 236 / 654
» Approximate String Processing
Sort
View
CIE
2005
Springer
15 years 5 months ago
Domain-Theoretic Formulation of Linear Boundary Value Problems
Abstract. We present a domain theoretic framework for obtaining exact solutions of linear boundary value problems. Based on the domain of compact real intervals, we show how to app...
Dirk Pattinson
NETWORKING
2000
15 years 4 months ago
Computing Blocking Probabilities in Multi-class Wavelength Routing Networks
We present an approximate analytical method to compute efficiently the call blocking probabilities in wavelength routing networks with multiple classes of calls. The model is fairl...
Sridhar Ramesh, George N. Rouskas, Harry G. Perros
PR
2008
97views more  PR 2008»
15 years 3 months ago
SVD based initialization: A head start for nonnegative matrix factorization
We describe Nonnegative Double Singular Value Decomposition (NNDSVD), a new method designed to enhance the initialization stage of nonnegative matrix factorization (NMF). NNDSVD c...
Christos Boutsidis, Efstratios Gallopoulos
CCE
2004
15 years 3 months ago
Computational studies using a novel simplicial-approximation based algorithm for MINLP optimization
Significant advances have been made in the last two decades for the effective solution of mixed integer non-linear programming (MINLP) problems, mainly by exploiting the special s...
Vishal Goyal, Marianthi G. Ierapetritou
QUESTA
2007
92views more  QUESTA 2007»
15 years 2 months ago
Estimation for queues from queue length data
We consider the estimation of arrival and service rates for queues based on queue length data collected at successive, not necessarily equally spaced, time points. In particular, ...
J. V. Ross, T. Taimre, Philip K. Pollett