Sciweavers

736 search results - page 53 / 148
» A dynamic data structure for approximate range searching
Sort
View
KDD
2000
ACM
222views Data Mining» more  KDD 2000»
14 years 11 days ago
Interactive exploration of very large relational datasets through 3D dynamic projections
The grand tour, one of the most popular methods for multidimensional data exploration, is based on orthogonally projecting multidimensional data to a sequence of lower dimensional...
Li Yang
VLDB
2004
ACM
125views Database» more  VLDB 2004»
14 years 2 months 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
AMR
2005
Springer
137views Multimedia» more  AMR 2005»
14 years 2 months ago
Information Retrieval of Sequential Data in Heterogeneous XML Databases
The XML language is a W3C standard sustained by both the industry and the scientific community. Therefore, the available information annotated in XML keeps and will keep increasing...
Eugen Popovici, Pierre-Francois Marteau, Gildas M&...
KDD
2007
ACM
155views Data Mining» more  KDD 2007»
14 years 9 months ago
A framework for community identification in dynamic social networks
We propose frameworks and algorithms for identifying communities in social networks that change over time. Communities are intuitively characterized as "unusually densely kni...
Chayant Tantipathananandh, Tanya Y. Berger-Wolf, D...
SEM
2004
Springer
14 years 2 months ago
Integration of a Text Search Engine with a Java Messaging Service
Large-scale information processing applications must rapidly search through high volume streams of structured and unstructured textual data to locate useful information. Content-ba...
Justin Almquist, Ian Gorton, Jereme Haack