Sciweavers

335 search results - page 24 / 67
» High quality graph partitioning
Sort
View
HPDC
2009
IEEE
14 years 5 months ago
Maintaining reference graphs of globally accessible objects in fully decentralized distributed systems
Since the advent of electronic computing, the processors’ clock speed has risen tremendously. Now that energy efficiency requirements have stopped that trend, the number of proc...
Björn Saballus, Thomas Fuhrmann
BICOB
2009
Springer
14 years 5 months ago
Graph Spectral Approach for Identifying Protein Domains
Here we present a simple method based on graph spectral properties to automatically partition multi-domain proteins into individual domains. The identification of structural domain...
Hari Krishna Yalamanchili, Nita Parekh
TVLSI
2002
161views more  TVLSI 2002»
13 years 10 months ago
Arbitrarily shaped rectilinear module placement using the transitive closure graph representation
In this paper, we deal with arbitrarily shaped rectilinear module placement using the transitive closure graph (TCG) representation. The geometric meanings of modules are transpare...
Jai-Ming Lin, Hsin-Lung Chen, Yao-Wen Chang
ICIP
2006
IEEE
15 years 18 days ago
Low Complexity Inter-Mode Selection for H.264
The coding efficiency of the H.264/AVC standard enables the transmission of high quality video over bandwidth limited networks. Due to the use of multiple Macroblock (MB) partitio...
Seydou-Nourou Ba, Yucel Altunbasak, Hasan F. Ates
P2P
2003
IEEE
110views Communications» more  P2P 2003»
14 years 4 months ago
The Effectiveness of Realistic Replication Strategies on Quality of Availability for Peer-to-Peer Systems
In this paper, we take an availability-centric view on quality of service (QoS) and propose a model and mechanisms for studying the effectiveness of realistic replication schemes ...
Giwon On, Jens Schmitt, Ralf Steinmetz