Sciweavers

390 search results - page 66 / 78
» Approximate Query Answering in Locally Closed Databases
Sort
View
KDD
2004
ACM
137views Data Mining» more  KDD 2004»
15 years 3 months ago
Mining scale-free networks using geodesic clustering
Many real-world graphs have been shown to be scale-free— vertex degrees follow power law distributions, vertices tend to cluster, and the average length of all shortest paths is...
Andrew Y. Wu, Michael Garland, Jiawei Han
ICDE
2002
IEEE
143views Database» more  ICDE 2002»
15 years 11 months ago
Discovering Similar Multidimensional Trajectories
We investigate techniques for analysis and retrieval of object trajectories in a two or three dimensional space. Such kind of data usually contain a great amount of noise, that ma...
Michail Vlachos, Dimitrios Gunopulos, George Kolli...
BMCBI
2005
134views more  BMCBI 2005»
14 years 9 months ago
Windows .NET Network Distributed Basic Local Alignment Search Toolkit (W.ND-BLAST)
Background: BLAST is one of the most common and useful tools for Genetic Research. This paper describes a software application we have termed Windows .NET Distributed Basic Local ...
Scot E. Dowd, Joaquin Zaragoza, Javier R. Rodrigue...
SSD
2007
Springer
146views Database» more  SSD 2007»
15 years 3 months ago
Blind Evaluation of Nearest Neighbor Queries Using Space Transformation to Preserve Location Privacy
In this paper we propose a fundamental approach to perform the class of Nearest Neighbor (NN) queries, the core class of queries used in many of the location-based services, withou...
Ali Khoshgozaran, Cyrus Shahabi
BIBE
2005
IEEE
126views Bioinformatics» more  BIBE 2005»
15 years 3 months ago
Highly Scalable and Accurate Seeds for Subsequence Alignment
We propose a method for finding seeds for the local alignment of two nucleotide sequences. Our method uses randomized algorithms to find approximate seeds. We present a dynamic ...
Abhijit Pol, Tamer Kahveci