Sciweavers

6546 search results - page 359 / 1310
» Improving the Performance of the RISE Algorithm
Sort
View
DIAGRAMS
2006
Springer
15 years 10 months ago
Exploring the Effect of Animation and Progressive Revealing on Diagrammatic Problem Solving
We conducted eye-tracking studies of subjects solving the problem of finding shortest paths in a graph using a known procedure (Dijkstra's algorithm). The goal of these studie...
Daesub Yoon, N. Hari Narayanan, SooCheol Lee, Oh-C...
SIAMCOMP
2008
124views more  SIAMCOMP 2008»
15 years 6 months ago
A Faster, Better Approximation Algorithm for the Minimum Latency Problem
We give a 7.18-approximation algorithm for the minimum latency problem that uses only O(n log n) calls to the prize-collecting Steiner tree (PCST) subroutine of Goemans and Willia...
Aaron Archer, Asaf Levin, David P. Williamson
FIMI
2003
146views Data Mining» more  FIMI 2003»
15 years 8 months ago
ARMOR: Association Rule Mining based on ORacle
In this paper, we first focus our attention on the question of how much space remains for performance improvement over current association rule mining algorithms. Our strategy is...
Vikram Pudi, Jayant R. Haritsa
FLAIRS
2010
15 years 9 months ago
Meta-Prediction for Collective Classification
When data instances are inter-related, as are nodes in a social network or hyperlink graph, algorithms for collective classification (CC) can significantly improve accuracy. Recen...
Luke McDowell, Kalyan Moy Gupta, David W. Aha
ACMMSP
2005
ACM
129views Hardware» more  ACMMSP 2005»
16 years 8 days ago
A locality-improving dynamic memory allocator
In general-purpose applications, most data is dynamically allocated. The memory manager therefore plays a crucial role in application performance by determining the spatial locali...
Yi Feng, Emery D. Berger