Sciweavers

4850 search results - page 586 / 970
» Approximate Data Structures with Applications
Sort
View
ESORICS
2005
Springer
16 years 12 days ago
Privacy Preserving Clustering
The freedom and transparency of information flow on the Internet has heightened concerns of privacy. Given a set of data items, clustering algorithms group similar items together...
Somesh Jha, Louis Kruger, Patrick McDaniel
160
Voted
KES
2005
Springer
16 years 11 days ago
Feature Generation by Simple FLD
This paper presents a new algorithm for feature generation, which is approximately derived based on geometrical interpretation of the Fisher linear discriminant analysis. In a fiel...
Minoru Fukumi, Yasue Mitsukura
VLDB
2004
ACM
125views Database» more  VLDB 2004»
16 years 6 days ago
Reverse kNN Search in Arbitrary Dimensionality
Given a point q, a reverse k nearest neighbor (RkNN) query retrieves all the data points that have q as one of their k nearest neighbors. Existing methods for processing such quer...
Yufei Tao, Dimitris Papadias, Xiang Lian
EDBTW
2006
Springer
15 years 10 months ago
Towards Similarity-Based Topological Query Languages
Abstract. In recent times, the proliferation of spatial data on the Internet is beginning to allow a much larger audience to access and share data currently available in various Ge...
Alberto Belussi, Omar Boucelma, Barbara Catania, Y...
EDBT
2009
ACM
117views Database» more  EDBT 2009»
15 years 10 months ago
Parsimonious temporal aggregation
Temporal aggregation is a crucial operator in temporal databases and has been studied in various flavors. In instant temporal aggregation (ITA) the aggregate value at time instan...
Juozas Gordevicius, Johann Gamper, Michael H. B&ou...