FOCS
2003
IEEE
14 years 3 months ago
2003
IEEE
Suffix trees and suffix arrays are the most prominent full-text indices, and their construction algorithms are well studied. In the literature, the fastest algorithm runs in O(n...
FOCS
2003
IEEE
14 years 3 months ago
2003
IEEE
We give improved approximation algorithms for a variety of latency minimization problems. In particular, we give a 3.591 -approximation to the minimum latency problem, improving o...
DATE
2003
IEEE
2003
IEEE
Exploiting the Routing Flexibility for Energy/Performance Aware Mapping of Regular NoC Architectures
14 years 3 months ago
In this paper, we present an algorithm which automatically maps the IPs onto a generic regular Network on Chip (NoC) architecture and constructs a deadlock-free deterministic rout...
CGI
2003
IEEE
14 years 3 months ago
2003
IEEE
We present a new fast algorithm for rendering the depthof-field effect for point-based surfaces. The algorithm handles partial occlusion correctly, it does not suffer from intens...
ARITH
2003
IEEE
14 years 3 months ago
2003
IEEE
We propose an algorithm for modular multiplication/division suitable for VLSI implementation. The algorithm is based on Montgomery’s method for modular multiplication and on the...
ACSC
2003
IEEE
14 years 3 months ago
2003
IEEE
We describe two algorithms for static path-planning, with the aim of deriving the trajectory that always maximises the distance of the path from the nearest obstacle. The bubble a...
3DIM
2003
IEEE
14 years 3 months ago
2003
IEEE
The Iterative Closest Point (ICP) algorithm is a widely used method for aligning three-dimensional point sets. The quality of alignment obtained by this algorithm depends heavily ...
PDP
2010
IEEE
14 years 3 months ago
2010
IEEE
Abstract—Load balancing algorithms are an essential component of parallel computing reducing the response time of applications. Frequently, balancing algorithms have a centralize...
ISQED
2010
IEEE
14 years 3 months ago
2010
IEEE
- In this paper, we propose a thermal-aware job allocation and scheduling algorithm for three-dimensional (3D) chip multiprocessor (CMP). The proposed algorithm assigns hot jobs to...
WIA
2004
Springer
14 years 3 months ago
2004
Springer
Abstract. Hopcroft’s algorithm for minimizing a deterministic automaton has complexity O(n log n). We show that this complexity bound is tight. More precisely, we provide a famil...