Sciweavers

1162 search results - page 139 / 233
» Minimum Cycle Bases in Graphs Algorithms and Applications
Sort
View
KDD
2004
ACM
137views Data Mining» more  KDD 2004»
14 years 1 months 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
SPIRE
2005
Springer
14 years 1 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
ICDM
2006
IEEE
134views Data Mining» more  ICDM 2006»
14 years 2 months ago
Fast Frequent Free Tree Mining in Graph Databases
Free tree, as a special graph which is connected, undirected and acyclic, is extensively used in domains such as computational biology, pattern recognition, computer networks, XML...
Peixiang Zhao, Jeffrey Xu Yu
IUI
2004
ACM
14 years 1 months ago
WOLD: a mixed-initiative wizard for producing multi-platform user interfaces
WOLD (Wizard fOr Leveraging the Development of multi-platform user interfaces) helps designers to produce running user interfaces to data bases of information systems simultaneous...
Julien Stocq, Jean Vanderdonckt
DAC
2009
ACM
14 years 17 hour ago
Reduction techniques for synchronous dataflow graphs
The Synchronous Dataflow (SDF) model of computation is popular for modelling the timing behaviour of real-time embedded hardware and software systems and applications. It is an es...
Marc Geilen