Sciweavers

11212 search results - page 630 / 2243
» Semi-persistent Data Structures
Sort
View
SIGCSE
1998
ACM
131views Education» more  SIGCSE 1998»
15 years 11 months ago
Animation, visualization, and interaction in CS 1 assignments
Programs that use animations or visualizations attract student interest and offer feedback that can enhance different learning styles as students work to master programming and pr...
Owen L. Astrachan, Susan H. Rodger
KDD
1998
ACM
146views Data Mining» more  KDD 1998»
15 years 11 months ago
Mining Association Rules in Hypertext Databases
In this workweproposea generalisation of the notion of associationrule in the contextof flat transactions to that of a compositeassociation rule in the context of a structured dir...
José Borges, Mark Levene
COMPGEOM
1997
ACM
15 years 11 months ago
Approximate Nearest Neighbor Queries Revisited
This paper proposes new methods to answer approximate nearest neighbor queries on a set of n points in d-dimensional Euclidean space. For any xed constant d, a data structure with...
Timothy M. Chan
ASWEC
2004
IEEE
15 years 11 months ago
Obstacles to a Totally Functional Programming Style
"Totally Functional Programming" (TFP) advocates the complete replacement of symbolic representations for data by functions. TFP is motivated by observations from practi...
Paul A. Bailes, Colin J. M. Kemp
COOPIS
2004
IEEE
15 years 11 months ago
SPREE: Object Prefetching for Mobile Computers
Mobile platforms combined with large databases promise new opportunities for mobile applications. However, mobile computing devices may experience frequent communication loss while...
Kristian Kvilekval, Ambuj K. Singh