Sciweavers

1461 search results - page 130 / 293
» The Cost of Cache-Oblivious Searching
Sort
View
ICPR
2010
IEEE
15 years 4 months ago
Efficient Polygonal Approximation of Digital Curves via Monte Carlo Optimization
A novel stochastic searching scheme based on the Monte Carlo optimization is presented for polygonal approximation (PA) problem. We propose to combine the split-and-merge based lo...
Xiuzhuang Zhou, Yao Lu
WISEC
2010
ACM
15 years 4 months ago
Preventing multi-query attack in location-based services
Despite increasing popularity, Location-based Services (LBS) (e.g., searching nearby points-of-interest on map) on mobile handheld devices have been subject to major privacy conce...
Nilothpal Talukder, Sheikh Iqbal Ahamed
MMS
2011
15 years 1 months ago
Dynamic behavior of balanced NV-trees
Abstract In recent years, some approximate highdimensional indexing techniques have shown promising results by trading off quality guarantees for improved query performance. While ...
Arnar Ólafsson, Björn Þór...
BMCBI
2011
14 years 10 months ago
Robust joint analysis allowing for model uncertainty in two-stage genetic association studies
Background: The cost efficient two-stage design is often used in genome-wide association studies (GWASs) in searching for genetic loci underlying the susceptibility for complex di...
Dongdong Pan, Qizhai Li, Ningning Jiang, Aiyi Liu,...
PVLDB
2011
14 years 9 months ago
An Incremental Hausdorff Distance Calculation Algorithm
The Hausdorff distance is commonly used as a similarity measure between two point sets. Using this measure, a set X is considered similar to Y iff every point in X is close to at ...
Sarana Nutanong, Edwin H. Jacox, Hanan Samet