Sciweavers

15254 search results - page 85 / 3051
» A k
Sort
View
ADBIS
2000
Springer
79views Database» more  ADBIS 2000»
15 years 2 months ago
Distributed Searching of k-Dimensional Data with Almost Constant Costs
Abstract. In this paper we consider the dictionary problem in the scalable distributed data structure paradigm introduced by Litwin, Neimat and Schneider and analyze costs for inse...
Adriano Di Pasquale, Enrico Nardelli
ICDE
2010
IEEE
240views Database» more  ICDE 2010»
15 years 2 months ago
Top-K aggregation queries over large networks
Searching and mining large graphs today is critical to a variety of application domains, ranging from personalized recommendation in social networks, to searches for functional ass...
Xifeng Yan, Bin He, Feida Zhu, Jiawei Han
SSDBM
2010
IEEE
117views Database» more  SSDBM 2010»
15 years 2 months ago
Subspace Similarity Search: Efficient k-NN Queries in Arbitrary Subspaces
There are abundant scenarios for applications of similarity search in databases where the similarity of objects is defined for a subset of attributes, i.e., in a subspace, only. Wh...
Thomas Bernecker, Tobias Emrich, Franz Graf, Hans-...
COCOON
1999
Springer
15 years 2 months ago
On Bounds for the k-Partitioning of Graphs
Sergei L. Bezrukov, Robert Elsässer, Ulf-Pete...