Sciweavers

1640 search results - page 242 / 328
» Deriving Private Information from Randomized Data
Sort
View
PODS
1998
ACM
152views Database» more  PODS 1998»
15 years 2 months ago
A Cost Model for Similarity Queries in Metric Spaces
We consider the problem of estimating CPU (distance computations) and I/O costs for processing range and k-nearest neighbors queries over metric spaces. Unlike the specific case ...
Paolo Ciaccia, Marco Patella, Pavel Zezula
INFSOF
2006
102views more  INFSOF 2006»
14 years 10 months ago
Comparison of software architecture reverse engineering methods
Problems related to interactions between components is a sign of problems with the software architecture of the system and are often costly to fix. Thus it is very desirable to id...
Catherine Stringfellow, C. D. Amory, Dileep Potnur...
EDBT
2009
ACM
184views Database» more  EDBT 2009»
15 years 4 months ago
Distributed similarity search in high dimensions using locality sensitive hashing
In this paper we consider distributed K-Nearest Neighbor (KNN) search and range query processing in high dimensional data. Our approach is based on Locality Sensitive Hashing (LSH...
Parisa Haghani, Sebastian Michel, Karl Aberer
BILDMED
2007
134views Algorithms» more  BILDMED 2007»
14 years 11 months ago
Generation of Hulls Encompassing Neuronal Pathways Based on Tetrahedralization and 3D Alpha Shapes
Abstract. Diffusion tensor imaging provides information about structure and location of white matter tracts within the human brain which is of particular interest for neurosurgery...
Dorit Merhof, Martin Meister, Ezgi Bingöl, Pe...
WSC
2008
15 years 7 days ago
Phrase based browsing for simulation traces of network protocols
Most discrete event simulation frameworks are able to output simulation runs as a trace. The Network Simulator 2 (NS2) is a prominent example that does so to decouple generation o...
Nathan J. Schmidt, Peter Kemper