Sciweavers

2314 search results - page 250 / 463
» Minimal Partitions of a Graph
Sort
View
GMP
2006
IEEE
120views Solid Modeling» more  GMP 2006»
15 years 10 months ago
Spectral Sequencing Based on Graph Distance
The construction of linear mesh layouts has found various applications, such as implicit mesh filtering and mesh streaming, where a variety of layout quality criteria, e.g., span ...
Rong Liu, Hao Zhang 0002, Oliver van Kaick
IFIP
2004
Springer
15 years 9 months ago
Selective Channel Scanning for Fast Handoff in Wireless LAN Using Neighbor Graph
: Handoff at the link layer 2 (L2) consists of three phases including scanning, authentication, and reassociation. Among the three phases, scanning is dominant in terms of time del...
Sang-Hee Park, Hye-Soo Kim, Chun-Su Park, Jae-Won ...
LCTRTS
2004
Springer
15 years 9 months ago
Generating fast code from concurrent program dependence graphs
While concurrency in embedded systems is most often supplied by real-time operating systems, this approach can be unpredictable and difficult to debug. Synchronous concurrency, i...
Jia Zeng, Cristian Soviani, Stephen A. Edwards
CIKM
2008
Springer
15 years 6 months ago
Mining conceptual graphs for knowledge acquisition
This work addresses the use of computational linguistic analysis techniques for conceptual graphs learning from unstructured texts. A technique including both content mining and i...
Milagros Fernández, Eric Villemonte de la C...
DIAGRAMS
2008
Springer
15 years 6 months ago
Diagrammatic Logic of Existential Graphs: A Case Study of Commands
Diagrammatic logics have advantages over symbolic cousins. Peirce thought that logical diagrams (Existential Graphs, EG) are capable of "expression of all assertions", as...
Ahti-Veikko Pietarinen