Sciweavers

1623 search results - page 83 / 325
» No Sorting
Sort
View
GRAPHICSINTERFACE
1996
15 years 5 months ago
Exploring Human Visualization of Computer Algorithms
Many educators have used Algorithm Visualization (AV) to teach students of computer science about how computer algorithms work. Our study sheds light on two important questions: (...
Sarah A. Douglas, Christopher D. Hundhausen, Donna...
DOLAP
2007
ACM
15 years 8 months ago
Optimal chunking of large multidimensional arrays for data warehousing
ss domain. Using this more abstract approach means that more data sources of varying types can be incorporated with less effort, and such heterogeneous data sources might be very r...
Ekow J. Otoo, Doron Rotem, Sridhar Seshadri
112
Voted
STOC
2003
ACM
98views Algorithms» more  STOC 2003»
16 years 4 months ago
On the limits of cache-obliviousness
In this paper, we present lower bounds for permuting and sorting in the cache-oblivious model. We prove that (1) I/O optimal cache-oblivious comparison based sorting is not possib...
Gerth Stølting Brodal, Rolf Fagerberg
118
Voted
VL
2008
IEEE
15 years 10 months ago
Towards the next generation of bug tracking systems
Developers typically rely on the information submitted by end-users to resolve bugs. We conducted a survey on information needs and commonly faced problems with bug reporting amon...
Sascha Just, Rahul Premraj, Thomas Zimmermann
ISAAC
2005
Springer
118views Algorithms» more  ISAAC 2005»
15 years 9 months ago
External Data Structures for Shortest Path Queries on Planar Digraphs
In this paper we present space-query trade-offs for external memory data structures that answer shortest path queries on planar directed graphs. For any S = Ω(N1+ ) and S = O(N2...
Lars Arge, Laura Toma