Sciweavers

280 search results - page 28 / 56
» New Algorithms for Enumerating All Maximal Cliques
Sort
View
SC
2004
ACM
15 years 11 months ago
Optimal File-Bundle Caching Algorithms for Data-Grids
The file-bundle caching problem arises frequently in scientific applications where jobs process several files concurrently. Consider a host system in a data-grid that maintains...
Ekow J. Otoo, Doron Rotem, Alexandru Romosan
DAM
2010
105views more  DAM 2010»
15 years 3 months ago
An iterative approach to graph irregularity strength
An assignment of positive integer weights to the edges of a simple graph G is called irregular if the weighted degrees of the vertices are all different. The irregularity strength,...
Michael Ferrara, Ronald J. Gould, Michal Karonski,...
CF
2008
ACM
15 years 8 months ago
Exact combinational logic synthesis and non-standard circuit design
Using a new exact synthesizer that automatically induces minimal universal boolean function libraries, we introduce two indicators for comparing their expressiveness: the first ba...
Paul Tarau, Brenda Luderman
GLOBECOM
2009
IEEE
16 years 22 days ago
Design of Signal Constellation Rearrangement (CoRe) for Multiple Relay Links
Abstract – This paper considers a design of signal constellations for trans-modulation (constellation rearrangement: CoRe) in a relay system with the multiple links in which the ...
Jin Woo Kim, Hee S. Lee, Jae Yung Ahn, Chung Gu Ka...
TSP
2008
86views more  TSP 2008»
15 years 5 months ago
Fixed-Complexity Soft MIMO Detection via Partial Marginalization
Abstract--This paper presents a new approach to soft demodulation for MIMO channels. The proposed method is an approximation to the exact a posteriori probability-per-bit computer....
Erik G. Larsson, Joakim Jalden