Sciweavers

960 search results - page 160 / 192
» CURE: An Efficient Clustering Algorithm for Large Databases
Sort
View
223
Voted
ICDE
2007
IEEE
185views Database» more  ICDE 2007»
16 years 5 months ago
On k-Nearest Neighbor Searching in Non-Ordered Discrete Data Spaces
A k-nearest neighbor (k-NN) query retrieves k objects from a database that are considered to be the closest to a given query point. Numerous techniques have been proposed in the p...
Dashiell Kolbe, Qiang Zhu, Sakti Pramanik
168
Voted
HASE
2008
IEEE
15 years 10 months ago
Low Cost Secure Computation for the General Client-Server Computation Model
Due to the large number of attacks on open networks, information theft becomes a more and more severe problem. Secure computation can offer highly assured confidentiality protecti...
Liangliang Xiao, I-Ling Yen, Farokh B. Bastani
121
Voted
CIKM
2009
Springer
15 years 7 months ago
Robust record linkage blocking using suffix arrays
Record linkage is an important data integration task that has many practical uses for matching, merging and duplicate removal in large and diverse databases. However, a quadratic ...
Timothy de Vries, Hui Ke, Sanjay Chawla, Peter Chr...
138
Voted
BMCBI
2008
187views more  BMCBI 2008»
15 years 3 months ago
PSAT: A web tool to compare genomic neighborhoods of multiple prokaryotic genomes
Background: The conservation of gene order among prokaryotic genomes can provide valuable insight into gene function, protein interactions, or events by which genomes have evolved...
Christine Fong, Laurence Rohmer, Matthew Radey, Mi...
229
Voted
SIGMOD
2009
ACM
175views Database» more  SIGMOD 2009»
16 years 3 months ago
Ranking distributed probabilistic data
Ranking queries are essential tools to process large amounts of probabilistic data that encode exponentially many possible deterministic instances. In many applications where unce...
Feifei Li, Ke Yi, Jeffrey Jestes