Sciweavers

ICCSA
2010
Springer
13 years 11 months ago
String Matching with Mismatches by Real-Valued FFT
String matching with mismatches is a basic concept of information retrieval with some kinds of approximation. This paper proposes an FFT-based algorithm for the problem of string ...
Kensuke Baba
CC
2010
Springer
150views System Software» more  CC 2010»
13 years 11 months ago
Practical Extensions to the IFDS Algorithm
Abstract. This paper presents four extensions to the Interprocedural Finite Distributive Subset (IFDS) algorithm that make it applicable to a wider class of analysis problems. IFDS...
Nomair A. Naeem, Ondrej Lhoták, Jonathan Ro...
CC
2010
Springer
179views System Software» more  CC 2010»
13 years 11 months ago
Validating Register Allocation and Spilling
Abstract. Following the translation validation approach to highassurance compilation, we describe a new algorithm for validating a posteriori the results of a run of register alloc...
Silvain Rideau, Xavier Leroy
SI3D
2010
ACM
13 years 11 months ago
Parallel Banding Algorithm to compute exact distance transform with the GPU
We propose a Parallel Banding Algorithm (PBA) on the GPU to compute the exact Euclidean Distance Transform (EDT) for a binary image in 2D and higher dimensions. Partitioning the i...
Thanh-Tung Cao, Ke Tang, Anis Mohamed, Tiow Seng T...
SI3D
2010
ACM
13 years 11 months ago
Assisted texture assignment
Virtual environments are typically textured by manually choosing an image to apply on each surface. This implies browsing through large sets of generic textures for each and every...
Matthäus G. Chajdas, Sylvain Lefebvre, Marc S...
SAC
2010
ACM
13 years 11 months ago
A wavelet-based sampling algorithm for wireless sensor networks applications
This work proposes and evaluates a sampling algorithm based on wavelet transforms with Coiflets basis to reduce the data sensed in wireless sensor networks applications. The Coi...
André L. L. de Aquino, Ricardo A. R. Olivei...
STACS
2010
Springer
13 years 12 months ago
Online Correlation Clustering
We study the online clustering problem where data items arrive in an online fashion. The algorithm maintains a clustering of data items into similarity classes. Upon arrival of v, ...
Claire Mathieu, Ocan Sankur, Warren Schudy
STACS
2010
Springer
13 years 12 months ago
Long Non-crossing Configurations in the Plane
We revisit several maximization problems for geometric networks design under the non-crossing constraint, first studied by Alon, Rajagopalan and Suri (ACM Symposium on Computation...
Noga Alon, Sridhar Rajagopalan, Subhash Suri
STACS
2010
Springer
13 years 12 months ago
Dispersion in Unit Disks
We present two new approximation algorithms with (improved) constant ratios for selecting n points in n unit disks such that the minimum pairwise distance among the points is maxi...
Adrian Dumitrescu, Minghui Jiang
STACS
2010
Springer
13 years 12 months ago
On Optimal Heuristic Randomized Semidecision Procedures, with Application to Proof Complexity
The existence of a (p-)optimal propositional proof system is a major open question in (proof) complexity; many people conjecture that such systems do not exist. Kraj´ıˇcek and P...
Edward A. Hirsch, Dmitry Itsykson