Sciweavers

1567 search results - page 77 / 314
» Compressing Relations and Indexes
Sort
View
PAMI
2002
106views more  PAMI 2002»
13 years 8 months ago
Performance Evaluation of Some Clustering Algorithms and Validity Indices
In this article, we evaluate the performance of three clustering algorithms, hard K-Means, single linkage, and a simulated annealing (SA) based technique, in conjunction with four ...
Ujjwal Maulik, Sanghamitra Bandyopadhyay
COLING
2010
13 years 4 months ago
Multi-Sentence Compression: Finding Shortest Paths in Word Graphs
We consider the task of summarizing a cluster of related sentences with a short sentence which we call multi-sentence compression and present a simple approach based on shortest p...
Katja Filippova
ICASSP
2011
IEEE
13 years 25 days ago
Guaranteed error correction based on Fourier Compressive Sensing and Projective Geometry
The sparse error correction is intimately related to Compressive Sensing. Exploiting this connection, the paper proposes an error correction scheme pivoted on partial Fourier matr...
B. S. Adiga, M. Girish Chandra, Shreeniwas Sapre
ENTCS
2010
66views more  ENTCS 2010»
13 years 9 months ago
A Nominal Relational Model for Local Store
The theory of nominal sets is a theory for names, freshness and binders. It has recently been suggested as a framework for modelling local store because it allows for a more eleme...
Rasmus Ejlers Møgelberg
CORR
2008
Springer
142views Education» more  CORR 2008»
13 years 7 months ago
A Join Index for XML Data Warehouses
XML data warehouses form an interesting basis for decision-support applications that exploit complex data. However, native-XML database management systems (DBMSs) currently bear l...
Hadj Mahboubi, Kamel Aouiche, Jérôme ...