Sciweavers

2635 search results - page 399 / 527
» Algorithms for the Database Layout Problem
Sort
View
PODS
2006
ACM
95views Database» more  PODS 2006»
16 years 4 months ago
Randomized computations on large data sets: tight lower bounds
We study the randomized version of a computation model (introduced in [9, 10]) that restricts random access to external memory and internal memory space. Essentially, this model c...
André Hernich, Martin Grohe, Nicole Schweik...
KDD
2005
ACM
149views Data Mining» more  KDD 2005»
15 years 10 months ago
A distributed learning framework for heterogeneous data sources
We present a probabilistic model-based framework for distributed learning that takes into account privacy restrictions and is applicable to scenarios where the different sites ha...
Srujana Merugu, Joydeep Ghosh
CORR
2011
Springer
235views Education» more  CORR 2011»
14 years 11 months ago
On the accuracy of language trees
Historical linguistics aims at inferring the most likely language phylogenetic tree starting from information concerning the evolutionary relatedness of languages. The available i...
Simone Pompei, Vittorio Loreto, Francesca Tria
KDD
2012
ACM
194views Data Mining» more  KDD 2012»
13 years 6 months ago
A sparsity-inducing formulation for evolutionary co-clustering
Traditional co-clustering methods identify block structures from static data matrices. However, the data matrices in many applications are dynamic; that is, they evolve smoothly o...
Shuiwang Ji, Wenlu Zhang, Jun Liu
ICDE
2003
IEEE
102views Database» more  ICDE 2003»
16 years 5 months ago
Schema Mediation in Peer Data Management Systems
Intuitively, data management and data integration tools should be well-suited for exchanging information in a semantically meaningful way. Unfortunately, they suffer from two sign...
Alon Y. Halevy, Zachary G. Ives, Dan Suciu, Igor T...