Sciweavers

5523 search results - page 156 / 1105
» Improving application performance with hardware data structu...
Sort
View
132
Voted
EDBT
2000
ACM
15 years 7 months ago
Slim-Trees: High Performance Metric Trees Minimizing Overlap Between Nodes
In this paper we present the Slim-tree, a dynamic tree for organizing metric datasets in pages of fixed size. The Slim-tree uses the "fat-factor" which provides a simple ...
Caetano Traina Jr., Agma J. M. Traina, Bernhard Se...
121
Voted
COMPGEOM
2001
ACM
15 years 7 months ago
Segment intersection searching problems in general settings
We consider segment intersection searching amidst (possibly intersecting) algebraic arcs in the plane. We show how to preprocess n arcs in time O(n2+ ) into a data structure of si...
Vladlen Koltun
ICST
2008
IEEE
15 years 10 months ago
Automated Session Data Repair for Web Application Regression Testing
This paper introduces an approach to web application regression testing, based upon repair of user session data. The approach is entirely automated. It consists of a white box exa...
Mark Harman, Nadia Alshahwan
ESTIMEDIA
2009
Springer
15 years 1 months ago
Inter-kernel data reuse and pipelining on chip-multiprocessors for multimedia applications
The increasing demand for low power and high performance multimedia embedded systems has motivated the need for effective solutions to satisfy application bandwidth and latency req...
Luis Angel D. Bathen, Yongjin Ahn, Nikil D. Dutt, ...
165
Voted
ISPD
2005
ACM
188views Hardware» more  ISPD 2005»
15 years 9 months ago
A semi-persistent clustering technique for VLSI circuit placement
Placement is a critical component of today's physical synthesis flow with tremendous impact on the final performance of VLSI designs. However, it accounts for a significant p...
Charles J. Alpert, Andrew B. Kahng, Gi-Joon Nam, S...