Sciweavers

2254 search results - page 296 / 451
» Computing the minimal covering set
Sort
View
JACM
2012
13 years 8 months ago
Continuous sampling from distributed streams
A fundamental problem in data management is to draw and maintain a sample of a large data set, for approximate query answering, selectivity estimation, and query planning. With la...
Graham Cormode, S. Muthukrishnan, Ke Yi, Qin Zhang
GECCO
2009
Springer
16 years 24 days ago
Multiobjectivization for parameter estimation: a case-study on the segment polarity network of drosophila
Mathematical modeling for gene regulative networks (GRNs) provides an effective tool for hypothesis testing in biology. A necessary step in setting up such models is the estimati...
Tim Hohm, Eckart Zitzler
SIGMOD
2011
ACM
176views Database» more  SIGMOD 2011»
14 years 9 months ago
Sharing work in keyword search over databases
An important means of allowing non-expert end-users to pose ad hoc queries — whether over single databases or data integration systems — is through keyword search. Given a set...
Marie Jacob, Zachary G. Ives
ECCV
2010
Springer
15 years 11 months ago
3D Point Correspondence by Minimum Description Length in Feature Space
Abstract. Finding point correspondences plays an important role in automatically building statistical shape models from a training set of 3D surfaces. For the point correspondence ...
SDM
2008
SIAM
139views Data Mining» more  SDM 2008»
15 years 7 months ago
Simultaneous Unsupervised Learning of Disparate Clusterings
Most clustering algorithms produce a single clustering for a given data set even when the data can be clustered naturally in multiple ways. In this paper, we address the difficult...
Prateek Jain, Raghu Meka, Inderjit S. Dhillon