LCPC
2005
Springer
14 years 10 months ago
2005
Springer
Abstract. We have designed and implemented an interprocedural algorithm to analyze symbolic value ranges that can be assumed by variables at any given point in a program. Our algor...
106
click to vote
LCPC
2005
Springer
14 years 10 months ago
2005
Springer
Abstract. Data copy is an important compiler optimization which dynamically rearranges the layout of arrays by copying their elements into local buffers. Traditionally, array copy...
ISSADS
2005
Springer
14 years 10 months ago
2005
Springer
We present a simple implementation of a token-based distributed mutual exclusion algorithm for multithreaded systems. Several per-node requests could be issued by threads running ...
ISSAC
2005
Springer
14 years 10 months ago
2005
Springer
Let A and B be two polynomials in [x,y] and let R = resx(A, B) denote the resultant of A and B taken wrt x. In this paper we modify Collins’ modular algorithm for computing R...
ISSAC
2005
Springer
14 years 10 months ago
2005
Springer
This paper presents a duality analysis and an algorithm for computing the multiplicity structure of a zero to a polynomial system, while the zero can be exact or approximate with ...
ISMIR
2005
Springer
14 years 10 months ago
2005
Springer
This paper proposes an algorithm for studying spectral contents of pitched sounds in real-world recordings. We assume that the 2nd -order difference, w.r.t. partial index, of a pi...
ISMIR
2005
Springer
14 years 10 months ago
2005
Springer
We describe a recursive algorithm to quickly compute the N nearest neighbors according to a similarity measure in a metric space. The algorithm exploits an intrinsic property of a...
ISMIR
2005
Springer
14 years 10 months ago
2005
Springer
A pitch spelling algorithm predicts the pitch names of the notes in a musical passage when given the onset-time, MIDI note number and possibly the duration and voice of each note....
ISAAC
2005
Springer
14 years 10 months ago
2005
Springer
In an orthogonal drawing of a planar graph G, each vertex is drawn as a point, each edge is drawn as a sequence of alternate horizontal and vertical line segments, and any two edge...
ISAAC
2005
Springer
14 years 10 months ago
2005
Springer
In this paper we study the k-means clustering problem. It is well-known that the general version of this problem is NP-hard. Numerous approximation algorithms have been proposed fo...