Sciweavers

11212 search results - page 157 / 2243
» Semi-persistent Data Structures
Sort
View
148
Voted
ILP
1999
Springer
15 years 6 months ago
Probabilistic Relational Models
Most real-world data is heterogeneous and richly interconnected. Examples include the Web, hypertext, bibliometric data and social networks. In contrast, most statistical learning...
Daphne Koller
113
Voted
SIGCSE
1999
ACM
135views Education» more  SIGCSE 1999»
15 years 7 months ago
Testers and visualizers for teaching data structures
We present two tools to support the teaching of data structures and algorithms: Visualizers, which provide interactive visualizations of user-written data structures, and Testers,...
Ryan Shaun Baker, Michael Boilen, Michael T. Goodr...
117
Voted
KDD
1998
ACM
122views Data Mining» more  KDD 1998»
15 years 6 months ago
Memory Placement Techniques for Parallel Association Mining
Many data mining tasks (e.g., Association Rules, Sequential Patterns) use complex pointer-based data structures (e.g., hash trees) that typically suffer from sub-optimal data loca...
Srinivasan Parthasarathy, Mohammed Javeed Zaki, We...
157
Voted
ALENEX
2001
215views Algorithms» more  ALENEX 2001»
15 years 4 months ago
An Empirical Study of a New Approach to Nearest Neighbor Searching
In nearest neighbor searching we are given a set of n data points in real d-dimensional space, d , and the problem is to preprocess these points into a data structure, so that give...
Songrit Maneewongvatana, David M. Mount
SIGSOFT
1993
ACM
15 years 6 months ago
Scalable Software Libraries
1 Many software libraries (e.g., the Booch C++ Components, libg++, NIHCL, COOL) provide components (classes) that implement data structures. Each component is written by hand and r...
Don S. Batory, Vivek Singhal, Marty Sirkin, Jeff T...