Sciweavers

4926 search results - page 214 / 986
» Two Graph Algorithms On an Associative Computing Model
Sort
View
FUIN
2007
123views more  FUIN 2007»
15 years 6 months ago
Analysis of Approximate Petri Nets by Means of Occurrence Graphs
Abstract. Approximate Petri nets (AP-nets) can be used for the knowledge representation and approximate reasoning. The AP-net model is defined on the basis of the rough set approa...
Zbigniew Suraj, Barbara Fryc
165
Voted
PERCOM
2006
ACM
16 years 6 months ago
Strong Edge Coloring for Channel Assignment in Wireless Radio Networks
Abstract-- We give efficient sequential and distributed approximation algorithms for strong edge coloring graphs modeling wireless networks. Strong edge coloring is equivalent to c...
Christopher L. Barrett, V. S. Anil Kumar, Madhav V...
SGP
2007
15 years 8 months ago
A streaming algorithm for surface reconstruction
We present a streaming algorithm for reconstructing closed surfaces from large non-uniform point sets based on a geometric convection technique. Assuming that the sample points ar...
Rémi Allègre, Raphaëlle Chaine,...
ADHOCNOW
2008
Springer
16 years 21 days ago
Localized Spanner Construction for Ad Hoc Networks with Variable Transmission Range
Abstract. This paper presents an algorithm for constructing a spanner for ad hoc networks whose nodes have variable transmission range. Almost all previous spanner constructions fo...
David Peleg, Liam Roditty
KDD
2004
ACM
207views Data Mining» more  KDD 2004»
16 years 6 months ago
SPIN: mining maximal frequent subgraphs from graph databases
One fundamental challenge for mining recurring subgraphs from semi-structured data sets is the overwhelming abundance of such patterns. In large graph databases, the total number ...
Jun Huan, Wei Wang 0010, Jan Prins, Jiong Yang