Sciweavers

3311 search results - page 447 / 663
» Modeling Relational Data by the Adjacency Model
Sort
View
AUTOMATICA
2010
127views more  AUTOMATICA 2010»
15 years 4 months ago
Partitioning datasets based on equalities among parameters
When a phenomenon is described by a parametric model and multiple datasets are available, a key problem in statistics is to discover which datasets are characterized by the same p...
Riccardo Porreca, Giancarlo Ferrari-Trecate
ISAAC
2009
Springer
175views Algorithms» more  ISAAC 2009»
16 years 1 months ago
Worst-Case and Smoothed Analysis of k-Means Clustering with Bregman Divergences
The k-means algorithm is the method of choice for clustering large-scale data sets and it performs exceedingly well in practice. Most of the theoretical work is restricted to the c...
Bodo Manthey, Heiko Röglin
ECCV
2010
Springer
15 years 10 months ago
Binary coherent edge descriptors
Patch descriptors are used for a variety of tasks ranging from finding corresponding points across images, to describing object category parts. In this paper, we propose an image ...
CLEIEJ
2004
168views more  CLEIEJ 2004»
15 years 6 months ago
Contributions of KDD to the Knowledge Management Process: a Case Study
Knowledge Discovery in Databases (KDD), as any organizational process, is carried out beneath a Knowledge Management (KM) model adopted (even informally) by a corporation. KDD is ...
Paulo de Tarso Costa de Sousa, Hércules Ant...
CIKM
2010
Springer
15 years 4 months ago
Automatic schema merging using mapping constraints among incomplete sources
Schema merging is the process of consolidating multiple schemas into a unified view. The task becomes particularly challenging when the schemas are highly heterogeneous and autono...
Xiang Li 0002, Christoph Quix, David Kensche, Sand...