Sciweavers

608 search results - page 19 / 122
» Distributed Searching of Multi-dimensional Data: A Performan...
Sort
View
146
Voted
PPOPP
2012
ACM
13 years 11 months ago
Massively parallel breadth first search using a tree-structured memory model
Analysis of massive graphs has emerged as an important area for massively parallel computation. In this paper, it is shown how the Fresh Breeze trees-of-chunks memory model may be...
Tom St. John, Jack B. Dennis, Guang R. Gao
122
Voted
DASFAA
2010
IEEE
189views Database» more  DASFAA 2010»
15 years 8 months ago
Peer-to-Peer Similarity Search Based on M-Tree Indexing
Similarity search in metric spaces has several important applications both in centralized and distributed environments. In centralized applications, such as similarity-based image ...
Akrivi Vlachou, Christos Doulkeridis, Yannis Kotid...
141
Voted
KDD
2009
ACM
248views Data Mining» more  KDD 2009»
15 years 8 months ago
PSkip: estimating relevance ranking quality from web search clickthrough data
1 In this article, we report our efforts in mining the information encoded as clickthrough data in the server logs to evaluate and monitor the relevance ranking quality of a commer...
Kuansan Wang, Toby Walker, Zijian Zheng
144
Voted
GRID
2007
Springer
15 years 9 months ago
Data placement for scientific applications in distributed environments
— Scientific applications often perform complex computational analyses that consume and produce large data sets. We are concerned with data placement policies that distribute dat...
Ann L. Chervenak, Ewa Deelman, Miron Livny, Mei-Hu...
137
Voted
DEBS
2010
ACM
14 years 10 months ago
Distributed structural and value XML filtering
Many XML filtering systems have emerged in recent years identifying XML data that structurally match XPath queries in an efficient way. However, apart from structural matching, it...
Iris Miliaraki, Manolis Koubarakis