Sciweavers

43 search results - page 6 / 9
» Double Clustering and Graph Navigability
Sort
View
ESWS
2008
Springer
13 years 10 months ago
Instance Based Clustering of Semantic Web Resources
Abstract. The original Semantic Web vision was explicit in the need for intelligent autonomous agents that would represent users and help them navigate the Semantic Web. We argue t...
Gunnar Aastrand Grimnes, Peter Edwards, Alun D. Pr...
SPIRE
2005
Springer
14 years 2 months ago
Using the k-Nearest Neighbor Graph for Proximity Searching in Metric Spaces
Proximity searching consists in retrieving from a database, objects that are close to a query. For this type of searching problem, the most general model is the metric space, where...
Rodrigo Paredes, Edgar Chávez
SIGMOD
2008
ACM
191views Database» more  SIGMOD 2008»
14 years 8 months ago
Efficient aggregation for graph summarization
Graphs are widely used to model real world objects and their relationships, and large graph datasets are common in many application domains. To understand the underlying character...
Yuanyuan Tian, Richard A. Hankins, Jignesh M. Pate...
SIGECOM
1999
ACM
202views ECommerce» more  SIGECOM 1999»
14 years 25 days ago
A methodology for workload characterization of E-commerce sites
Performance analysis and capacity planning for e-commerce sites poses an interesting problem: how to best characterize the workload of these sites. Tradition al workload character...
Daniel A. Menascé, Virgilio Almeida, Rodrig...
MIR
2003
ACM
174views Multimedia» more  MIR 2003»
14 years 1 months ago
Content-based image retrieval by clustering
In a typical content-based image retrieval (CBIR) system, query results are a set of images sorted by feature similarities with respect to the query. However, images with high fea...
Yixin Chen, James Ze Wang, Robert Krovetz