SCALESPACE
2005
Springer
14 years 3 months ago
2005
Springer
This paper presents an algorithm for computing stability of top-points in scale-space. The potential usefulness of top-points in scalespace has already been shown for a number of a...
SAT
2005
Springer
14 years 3 months ago
2005
Springer
We introduce ApproxCount, an algorithm that approximates the number of satisfying assignments or models of a formula in propositional logic. Many AI tasks, such as calculating degr...
SAT
2005
Springer
14 years 3 months ago
2005
Springer
We present an algorithm that decides the satisfiability of a
SAT
2005
Springer
14 years 3 months ago
2005
Springer
Many current local search algorithms for SAT fall into one of two classes. Random walk algorithms such as Walksat/SKC, Novelty+ and HWSAT are very successful but can be trapped for...
RISE
2005
Springer
14 years 3 months ago
2005
Springer
Abstract. This paper applies the Evolutionary Strategy (ES) metaheuristic to the automatic test data generation problem. The problem consists in creating automatically a set of inp...
PVM
2005
Springer
14 years 3 months ago
2005
Springer
We present an algorithm for implementing byte-range locks using MPI passive-target one-sided communication. This algorithm is useful in any scenario in which multiple processes of ...
PDCAT
2005
Springer
14 years 3 months ago
2005
Springer
Fault tolerant algorithms are often designed under the t-out-of-n assumption, which is based on the assumption that all processes or components fail independently with equal proba...
MLDM
2005
Springer
14 years 3 months ago
2005
Springer
Abstract. The ability to discover the topic of a large set of text documents using relevant keyphrases is usually regarded as a very tedious task if done by hand. Automatic keyphra...
MCS
2005
Springer
14 years 3 months ago
2005
Springer
We have previously introduced the Learn++ algorithm that provides surprisingly promising performance for incremental learning as well as data fusion applications. In this contribut...
LCTRTS
2005
Springer
14 years 3 months ago
2005
Springer
Knuth’s buddy system is an attractive algorithm for managing storage allocation, and it can be made to operate in real-time. At some point, storage-management systems must eithe...