Sciweavers

3958 search results - page 263 / 792
» Dynamic Graph Algorithms with Applications
Sort
View
EDBT
2009
ACM
118views Database» more  EDBT 2009»
16 years 1 months ago
Flexible query answering on graph-modeled data
The largeness and the heterogeneity of most graph-modeled datasets in several database application areas make the query process a real challenge because of the lack of a complete ...
Federica Mandreoli, Riccardo Martoglia, Giorgio Vi...
KDD
2004
ACM
137views Data Mining» more  KDD 2004»
16 years 14 days ago
Mining scale-free networks using geodesic clustering
Many real-world graphs have been shown to be scale-free— vertex degrees follow power law distributions, vertices tend to cluster, and the average length of all shortest paths is...
Andrew Y. Wu, Michael Garland, Jiawei Han
ICWSM
2008
15 years 8 months ago
Wikipedia as an Ontology for Describing Documents
Identifying topics and concepts associated with a set of documents is a task common to many applications. It can help in the annotation and categorization of documents and be used...
Zareen Saba Syed, Tim Finin, Anupam Joshi
SPIRE
2005
Springer
16 years 18 days 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
ACSC
2003
IEEE
16 years 13 days ago
Force-Transfer: A New Approach to Removing Overlapping Nodes in Graph Layout
Graphs where each node includes an amount of text are often used in applications. A typical example of such graphs is UML diagrams used in CASE tools. To make text information in ...
Xiaodi Huang, Wei Lai