Sciweavers

960 search results - page 145 / 192
» CURE: An Efficient Clustering Algorithm for Large Databases
Sort
View
165
Voted
CVPR
2004
IEEE
16 years 5 months ago
Fast Contour Matching Using Approximate Earth Mover's Distance
Weighted graph matching is a good way to align a pair of shapes represented by a set of descriptive local features; the set of correspondences produced by the minimum cost matchin...
Kristen Grauman, Trevor Darrell
134
Voted
DKE
2007
119views more  DKE 2007»
15 years 3 months ago
Association rules mining using heavy itemsets
A well-known problem that limits the practical usage of association rule mining algorithms is the extremely large number of rules generated. Such a large number of rules makes the...
Girish Keshav Palshikar, Mandar S. Kale, Manoj M. ...
144
Voted
BCB
2010
156views Bioinformatics» more  BCB 2010»
14 years 10 months ago
Accelerating HMMER on GPUs by implementing hybrid data and task parallelism
Many biologically motivated problems are expressed as dynamic programming recurrences and are difficult to parallelize due to the intrinsic data dependencies in their algorithms. ...
Narayan Ganesan, Roger D. Chamberlain, Jeremy Buhl...
120
Voted
DEXA
2007
Springer
154views Database» more  DEXA 2007»
15 years 10 months ago
Performance Oriented Schema Matching
Abstract. Semantic matching of schemas in heterogeneous data sharing systems is time consuming and error prone. Existing mapping tools employ semi-automatic techniques for mapping ...
Khalid Saleem, Zohra Bellahsene, Ela Hunt
225
Voted
VLDB
2005
ACM
146views Database» more  VLDB 2005»
16 years 3 months ago
Adaptive website recommendations with AWESOME
Recommendations are crucial for the success of large websites. While there are many ways to determine recommendations, the relative quality of these recommenders depends on many fa...
Andreas Thor, Nick Golovin, Erhard Rahm