Sciweavers

303 search results - page 15 / 61
» Update Algorithms for the Sketch Data Model
Sort
View
SIGMOD
2006
ACM
111views Database» more  SIGMOD 2006»
15 years 12 months ago
Reconciling while tolerating disagreement in collaborative data sharing
In many data sharing settings, such as within the biological and biomedical communities, global data consistency is not always attainable: different sites' data may be dirty,...
Nicholas E. Taylor, Zachary G. Ives
NIPS
1998
15 years 1 months ago
Maximum Conditional Likelihood via Bound Maximization and the CEM Algorithm
We present the CEM (Conditional Expectation Maximization) algorithm as an extension of the EM (Expectation Maximization) algorithm to conditional density estimation under missing ...
Tony Jebara, Alex Pentland
DEXAW
1999
IEEE
124views Database» more  DEXAW 1999»
15 years 4 months ago
A Web-Based Evolutionary Model for Internet Data Caching
Caching is a standard solution to the problem of insufcient bandwidth caused by the rapid increase of information circulation across the Internet. Cache consistency mechanisms are...
Athena Vakali
CVPR
2008
IEEE
16 years 1 months ago
Generalised blurring mean-shift algorithms for nonparametric clustering
Gaussian blurring mean-shift (GBMS) is a nonparametric clustering algorithm, having a single bandwidth parameter that controls the number of clusters. The algorithm iteratively sh...
Miguel Á. Carreira-Perpiñán
COCOON
2005
Springer
15 years 5 months ago
Finding Longest Increasing and Common Subsequences in Streaming Data
In this paper, we present algorithms and lower bounds for the Longest Increasing Subsequence (LIS) and Longest Common Subsequence (LCS) problems in the data streaming model. For t...
David Liben-Nowell, Erik Vee, An Zhu