Sciweavers

20778 search results - page 259 / 4156
» Algorithms for Data Migration
Sort
View
VLDB
1998
ACM
123views Database» more  VLDB 1998»
15 years 10 months ago
Diag-Join: An Opportunistic Join Algorithm for 1:N Relationships
Time of creation is one of the predominant (often implicit) clustering strategies found not only in Data Warehouse systems: line items are created together with their correspondin...
Sven Helmer, Till Westmann, Guido Moerkotte
KDD
2009
ACM
198views Data Mining» more  KDD 2009»
16 years 7 months ago
Pervasive parallelism in data mining: dataflow solution to co-clustering large and sparse Netflix data
All Netflix Prize algorithms proposed so far are prohibitively costly for large-scale production systems. In this paper, we describe an efficient dataflow implementation of a coll...
Srivatsava Daruru, Nena M. Marin, Matt Walker, Joy...
ICML
2007
IEEE
16 years 7 months ago
The rendezvous algorithm: multiclass semi-supervised learning with Markov random walks
We consider the problem of multiclass classification where both labeled and unlabeled data points are given. We introduce and demonstrate a new approach for estimating a distribut...
Arik Azran
VL
1994
IEEE
147views Visual Languages» more  VL 1994»
15 years 10 months ago
Role of Visual Languages in Developing Image Analysis Algorithms
Developers of new imageanalysis algorithmstypically require an interactive environment in which the imagedata can be passed through various operators, some of which may involve fe...
M. Stella Atkins, Torre Zuk, B. Johnston, T. Arden
CIMCA
2008
IEEE
15 years 8 months ago
RIAL: Redundancy Reducing Inlining Algorithm to Map XML DTD to Relations
XML has emerged as a common standard for data exchange over the World Wide Web. One way to manage XML data is to use the power of relational databases for storing and q...
Amir Jahangard Rafsanjani, Seyed-Hassan Mirian-Hos...