Sciweavers

475 search results - page 13 / 95
» Efficient Set Similarity Joins Using Min-prefixes
Sort
View
CCS
2006
ACM
13 years 11 months ago
An efficient key establishment scheme for secure aggregating sensor networks
Key establishment is a fundamental prerequisite for secure communication in wireless sensor networks. A new node joining the network needs to efficiently and autonomously set up s...
Erik-Oliver Blaß, Martina Zitterbart
GIS
1997
ACM
13 years 11 months ago
Speeding up Bulk-Loading of Quadtrees
Spatial indexes, such as the PMR quadtree, are important in spatial databases for efficient execution of queries involving spatial constraints, especially when the queries involve...
Gísli R. Hjaltason, Hanan Samet, Yoram J. S...
CLEF
2010
Springer
13 years 8 months ago
Fuzzy Semantic-Based String Similarity for Extrinsic Plagiarism Detection - Lab Report for PAN at CLEF 2010
This report explains our plagiarism detection method using fuzzy semantic-based string similarity approach. The algorithm was developed through four main stages. First is pre-proce...
Salha Alzahrani, Naomie Salim
BIBE
2006
IEEE
154views Bioinformatics» more  BIBE 2006»
14 years 1 months ago
Determining Molecular Similarity for Drug Discovery using the Wavelet Riemannian Metric
Discerning the similarity between two molecules is a challenging problem in drug discovery as well as in molecular biology. The importance of this problem is due to the fact that ...
Elinor Velasquez, Emmanuel R. Yera, Rahul Singh
AAAI
2006
13 years 9 months ago
Computing Slater Rankings Using Similarities among Candidates
Voting (or rank aggregation) is a general method for aggregating the preferences of multiple agents. One important voting rule is the Slater rule. It selects a ranking of the alte...
Vincent Conitzer