Sciweavers

2883 search results - page 199 / 577
» Algorithms for merged indexes
Sort
View
COLING
2008
15 years 7 months ago
Unsupervised Induction of Labeled Parse Trees by Clustering with Syntactic Features
We present an algorithm for unsupervised induction of labeled parse trees. The algorithm has three stages: bracketing, initial labeling, and label clustering. Bracketing is done f...
Roi Reichart, Ari Rappoport
SIGMOD
2004
ACM
182views Database» more  SIGMOD 2004»
16 years 6 months ago
Efficient set joins on similarity predicates
In this paper we present an efficient, scalable and general algorithm for performing set joins on predicates involving various similarity measures like intersect size, Jaccard-coe...
Sunita Sarawagi, Alok Kirpal
171
Voted
AAIM
2007
Springer
151views Algorithms» more  AAIM 2007»
16 years 10 days ago
Acyclic Edge Colouring of Outerplanar Graphs
An acyclic edge colouring of a graph is a proper edge colouring having no 2-coloured cycle, that is, a colouring in which the union of any two colour classes forms a linear forest...
Rahul Muthu, N. Narayanan, C. R. Subramanian
ISMIS
2005
Springer
15 years 11 months ago
Identifying Content Blocks from Web Documents
Intelligent information processing systems, such as digital libraries or search engines index web-pages according to their informative content. However, web-pages contain several n...
Sandip Debnath, Prasenjit Mitra, C. Lee Giles
WSC
2007
15 years 8 months ago
Estimating tranche spreads by loss process simulation
A credit derivative is a path dependent contingent claim on the aggregate loss in a portfolio of credit sensitive securities. We estimate the value of a credit derivative by Monte...
Kay Giesecke, Baeho Kim