Sciweavers

1327 search results - page 174 / 266
» Path following algorithm for the graph matching problem
Sort
View
106
Voted
CASES
2010
ACM
14 years 12 months ago
Instruction selection by graph transformation
Common generated instruction selections are based on tree pattern matching, but modern and custom architectures feature instructions, which cannot be covered by trees. To overcome...
Sebastian Buchwald, Andreas Zwinkau
ANOR
2010
112views more  ANOR 2010»
15 years 2 months ago
The Multi-Story Space Assignment Problem
-- The Multi-Story Space Assignment Problem (MSAP) is an innovative formulation of the multi-story facility assignment problem that allows one to model the location of departments ...
Peter M. Hahn, J. MacGregor Smith, Yi-Rong Zhu
IJCV
2006
116views more  IJCV 2006»
15 years 1 months ago
Structure-Texture Image Decomposition - Modeling, Algorithms, and Parameter Selection
This paper explores various aspects of the image decomposition problem using modern variational techniques. We aim at splitting an original image f into two components u and v, whe...
Jean-François Aujol, Guy Gilboa, Tony F. Ch...
NETWORK
2010
122views more  NETWORK 2010»
14 years 8 months ago
Betweenness centrality and resistance distance in communication networks
In this article we report on applications and extensions of weighted graph theory in the design and control of communication networks. We model the communication network as a weig...
Ali Tizghadam, Alberto Leon-Garcia
98
Voted
IPPS
2005
IEEE
15 years 7 months ago
Distributed Scheduling of Parallel I/O in the Presence of Data Replication
This paper studies distributed scheduling of parallel I/O data transfers on systems that provide data replication. In our previous work, we proposed a centralized algorithm for so...
Jan-Jan Wu, Pangfeng Liu