Sciweavers

820 search results - page 97 / 164
» Finding low-utility data structures
Sort
View
OSS
2007
Springer
14 years 3 months ago
Open Source Collaboration for Fostering Off-The-Shelf Components Selection
Abstract. The use of Off-The-Shelf software components in ComponentBased Development implies many challenges. One of them is the lack of available and well-suited data to support s...
Claudia P. Ayala, Carl-Fredrik Sørensen, Re...
ISCAS
2003
IEEE
140views Hardware» more  ISCAS 2003»
14 years 2 months ago
On use of averaging in FxLMS algorithm for single-channel feedforward ANC systems
In this paper an active noise control (ANC) algorithm is proposed. This algorithm is based on adaptive filtering with averaging (AFA) and uses a similar structure as that of the F...
Muhammad Tahir Akhtar, Masahide Abe, Masayuki Kawa...
SC
2000
ACM
14 years 1 months ago
Using Hardware Performance Monitors to Isolate Memory Bottlenecks
In this paper, we present and evaluate two techniques that use different styles of hardware support to provide data structure specific processor cache information. In one approach...
Bryan R. Buck, Jeffrey K. Hollingsworth
OOPSLA
1999
Springer
14 years 1 months ago
Removing Unnecessary Synchronization in Java
Java programs perform many synchronization operations on data structures. Some of these synchronizations are unnecessary; in particular, if an object is reachable only by a single ...
Jeff Bogda, Urs Hölzle
SWAT
1994
Springer
120views Algorithms» more  SWAT 1994»
14 years 28 days ago
Parallel Dynamic Lowest Common Ancestors
This paper gives a CREW PRAM algorithm for the problem of finding lowest common ancestors in a forest under the insertion of leaves and roots and the deletion of leaves. For a fore...
Erik Schenk