Sciweavers

1538 search results - page 37 / 308
» Spectral Techniques in Graph Algorithms
Sort
View
HPCC
2011
Springer
12 years 9 months ago
Heuristic-Based Techniques for Mapping Irregular Communication Graphs to Mesh Topologies
— Mapping of parallel applications on the network topology is becoming increasingly important on large supercomputers. Topology aware mapping can reduce the hops traveled by mess...
Abhinav Bhatele, Laxmikant V. Kalé
WWW
2006
ACM
14 years 10 months ago
Using graph matching techniques to wrap data from PDF documents
Wrapping is the process of navigating a data source, semiautomatically extracting data and transforming it into a form suitable for data processing applications. There are current...
Tamir Hassan, Robert Baumgartner
DAC
2009
ACM
14 years 2 months 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
ICDAR
2009
IEEE
14 years 4 months ago
User-Guided Wrapping of PDF Documents Using Graph Matching Techniques
There are a number of established products on the market for wrapping—semi-automatic navigation and extraction of data—from web pages. These solutions make use of the inherent...
Tamir Hassan
DAGSTUHL
2006
13 years 11 months ago
Many-to-Many Feature Matching in Object Recognition
One of the bottlenecks of current recognition (and graph matching) systems is their assumption of one-to-one feature (node) correspondence. This assumption breaks down in the gener...
Ali Shokoufandeh, Yakov Keselman, M. Fatih Demirci...