Sciweavers

1756 search results - page 134 / 352
» Directed scale-free graphs
Sort
View
DASFAA
2009
IEEE
93views Database» more  DASFAA 2009»
14 years 2 months ago
Top-K Correlation Sub-graph Search in Graph Databases
Recently, due to its wide applications, (similar) subgraph search has attracted a lot of attentions from database and data mining community, such as [13, 18, 19, 5]. In [8], Ke et ...
Lei Zou, Lei Chen 0002, Yansheng Lu
HIPC
2005
Springer
14 years 1 months ago
Design and Implementation of the HPCS Graph Analysis Benchmark on Symmetric Multiprocessors
Graph theoretic problems are representative of fundamental computations in traditional and emerging scientific disciplines like scientific computing, computational biology and b...
David A. Bader, Kamesh Madduri
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
GECCO
2003
Springer
120views Optimization» more  GECCO 2003»
14 years 1 months ago
System-Level Synthesis of MEMS via Genetic Programming and Bond Graphs
Initial results have been achieved for automatic synthesis of MEMS system-level lumped parameter models using genetic programming and bond graphs. This paper first discusses the ne...
Zhun Fan, Kisung Seo, Jianjun Hu, Ronald C. Rosenb...
ESA
2008
Springer
134views Algorithms» more  ESA 2008»
13 years 10 months ago
A Near-Tight Bound for the Online Steiner Tree Problem in Graphs of Bounded Asymmetry
The edge asymmetry of a directed, edge-weighted graph is defined as the maximum ratio of the weight of antiparallel edges in the graph, and can be used as a measure of the heterog...
Spyros Angelopoulos