Sciweavers

736 search results - page 27 / 148
» A dynamic data structure for approximate range searching
Sort
View
AP2PC
2003
Springer
14 years 2 months ago
G-Grid: A Class of Scalable and Self-Organizing Data Structures for Multi-dimensional Querying and Content Routing in P2P Networ
Peer-to-Peer (P2P) technologies promise to provide efficient distribution, sharing and management of resources, such as storage, processing, routing and other sundry service capabi...
Aris M. Ouksel, Gianluca Moro
KDD
2009
ACM
173views Data Mining» more  KDD 2009»
14 years 9 months ago
Constant-factor approximation algorithms for identifying dynamic communities
We propose two approximation algorithms for identifying communities in dynamic social networks. Communities are intuitively characterized as "unusually densely knit" sub...
Chayant Tantipathananandh, Tanya Y. Berger-Wolf
VLDB
2007
ACM
145views Database» more  VLDB 2007»
14 years 9 months ago
LCS-TRIM: Dynamic Programming Meets XML Indexing and Querying
In this article, we propose a new approach for querying and indexing a database of trees with specific applications to XML datasets. Our approach relies on representing both the q...
Shirish Tatikonda, Srinivasan Parthasarathy, Matth...
ESANN
2001
13 years 10 months ago
An integrated neural IR system
Over the years the amount and range of electronic text stored on the WWW has expanded rapidly, overwhelming both users and tools designed to index and search the information. It is...
Victoria J. Hodge, Jim Austin
COMPSAC
2004
IEEE
14 years 18 days ago
Spatial Data Query Support in Peer-to-Peer Systems
Recently distributed hash table (DHT) mechanisms have been proposed to manage data in very large, structured peer-to-peer (P2P) systems. DHT algorithms provide efficient exact-mat...
Roger Zimmermann, Wei-Shinn Ku, Haojun Wang