Sciweavers

3270 search results - page 119 / 654
» Approximate String Processing
Sort
View
CANPC
1998
Springer
15 years 6 months ago
Analysis of a Programmed Backoff Method for Parallel Processing on Ethernets
In many parallel processing applications, task times have relatively little variability. Accordingly, many nodes will complete a task at approximately the same time. If the applica...
Norman S. Matloff
CAV
2007
Springer
122views Hardware» more  CAV 2007»
15 years 6 months ago
Parameterized Verification of Infinite-State Processes with Global Conditions
We present a simple and effective approximated backward reachability algorithm for parameterized systems with existentially and universally quantified global conditions. The indivi...
Parosh Aziz Abdulla, Giorgio Delzanno, Ahmed Rezin...
NIPS
2004
15 years 3 months ago
Learning Gaussian Process Kernels via Hierarchical Bayes
We present a novel method for learning with Gaussian process regression in a hierarchical Bayesian framework. In a first step, kernel matrices on a fixed set of input points are l...
Anton Schwaighofer, Volker Tresp, Kai Yu
CN
2002
112views more  CN 2002»
15 years 1 months ago
Performance evaluation of a queue fed by a Poisson Pareto burst process
This paper provides means for performance evaluation of a queue with Poisson Pareto Burst Process (PPBP) input. Because of the long range dependent nature of the PPBP, straightfor...
Ron Addie, Timothy D. Neame, Moshe Zukerman
CJ
1998
118views more  CJ 1998»
15 years 1 months ago
Least-Squares Structuring, Clustering and Data Processing Issues
Approximation structuring clustering is an extension of what is usually called square-error clustering" onto various cluster structures and data formats. It appears to be not...
Boris Mirkin