Sciweavers

195 search results - page 23 / 39
» A Riemannian approach to graph embedding
Sort
View
GD
1995
Springer
13 years 11 months ago
Graph Folding: Extending Detail and Context Viewing into a Tool for Subgraph Comparisons
It is a di cult problem to display large, complex graphs in a manner which furthers comprehension. A useful approach is to expand selected sections foci of the graph revealing de...
M. Sheelagh T. Carpendale, David J. Cowperthwaite,...
WEBDB
2007
Springer
133views Database» more  WEBDB 2007»
14 years 1 months ago
EntityAuthority: Semantically Enriched Graph-Based Authority Propagation
This paper pursues the recently emerging paradigm of searching for entities that are embedded in Web pages. We utilize informationextraction techniques to identify entity candidat...
Julia Stoyanovich, Srikanta J. Bedathur, Klaus Ber...
SCOPES
2004
Springer
14 years 1 months ago
Compact Procedural Implementation in DSP Software Synthesis Through Recursive Graph Decomposition
Abstract. Synthesis of digital signal processing (DSP) software from dataflow-based formal models is an effective approach for tackling the complexity of modern DSP applications. I...
Ming-Yung Ko, Praveen K. Murthy, Shuvra S. Bhattac...
IEEEHPCS
2010
13 years 5 months ago
Reducing memory requirements of stream programs by graph transformations
Stream languages explicitly describe fork-join parallelism and pipelines, offering a powerful programming model for many-core Multi-Processor Systems on Chip (MPSoC). In an embedd...
Pablo de Oliveira Castro, Stéphane Louise, ...
KIVS
2011
Springer
12 years 10 months ago
A Feasibility Check for Geographical Cluster Based Routing under Inaccurate Node Localization in Wireless Sensor Networks
Localized geographic single path routing along a wireless network graph requires exact location information about the network nodes to assure message delivery guarantees. Node loc...
Hannes Frey, Ranjith Pillay