Sciweavers

11231 search results - page 307 / 2247
» Digging for Data Structures
Sort
View
ILP
1999
Springer
15 years 11 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
174
Voted
ESCIENCE
2007
IEEE
16 years 1 months ago
Community Training: Partitioning Schemes in Good Shape for Federated Data Grids
In federated Data Grids, individual institutions share their data sets within a community to enable collaborative data analysis. Data access needs to be provided in a scalable fas...
Tobias Scholl, Richard Kuntschke, Angelika Reiser,...
CVPR
2012
IEEE
13 years 9 months ago
Mode-seeking on graphs via random walks
Mode-seeking has been widely used as a powerful data analysis technique for clustering and filtering in a metric feature space. We introduce a versatile and efficient modeseekin...
Minsu Cho, Kyoung Mu Lee
KDD
1998
ACM
122views Data Mining» more  KDD 1998»
15 years 11 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...
ALENEX
2001
215views Algorithms» more  ALENEX 2001»
15 years 8 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