Sciweavers

1794 search results - page 231 / 359
» Visualizing Memory Graphs
Sort
View
ISAAC
2000
Springer
110views Algorithms» more  ISAAC 2000»
15 years 6 months ago
Online Routing in Convex Subdivisions
We consider online routing algorithms for finding paths between the vertices of plane graphs. We show (1) there exists a routing algorithm for arbitrary triangulations that has no...
Prosenjit Bose, Pat Morin, Andrej Brodnik, Svante ...
133
Voted
ARC
2010
Springer
167views Hardware» more  ARC 2010»
15 years 5 months ago
Systolic Algorithm Mapping for Coarse Grained Reconfigurable Array Architectures
Coarse Grained Reconfigurable Array (CGRA) architectures give high throughput and data reuse for regular algorithms while providing flexibility to execute multiple algorithms on th...
Kunjan Patel, Chris J. Bleakley
BMCBI
2006
199views more  BMCBI 2006»
15 years 2 months ago
PageMan: An interactive ontology tool to generate, display, and annotate overview graphs for profiling experiments
Background: Microarray technology has become a widely accepted and standardized tool in biology. The first microarray data analysis programs were developed to support pair-wise co...
Björn Usadel, Axel Nagel, Dirk Steinhauser, Y...
CONEXT
2009
ACM
15 years 3 months ago
Exploiting dynamicity in graph-based traffic analysis: techniques and applications
Network traffic can be represented by a Traffic Dispersion Graph (TDG) that contains an edge between two nodes that send a particular type of traffic (e.g., DNS) to one another. T...
Marios Iliofotou, Michalis Faloutsos, Michael Mitz...
126
Voted
LCTRTS
2009
Springer
15 years 9 months ago
Live-range unsplitting for faster optimal coalescing
Register allocation is often a two-phase approach: spilling of registers to memory, followed by coalescing of registers. Extreme liverange splitting (i.e. live-range splitting aft...
Sandrine Blazy, Benoît Robillard