4539 search results - page 255 / 908 » Approaches to Compute Workflow Complexity |
164
click to vote
ISCC
2008
IEEE
16 years 29 days ago
2008
IEEE
We propose efficient scheduling algorithms for downlink MIMO-CDMA systems using zero forcing beamforming to achieve high system throughput with low computational complexity. Base...
177
click to vote
GD
2005
Springer
16 years 2 days ago
2005
Springer
This paper presents a new framework for drawing graphs in three dimensions. In general, the new framework uses a divide and conquer approach. More specifically, the framework divi...
203
click to vote
RT
1995
Springer
15 years 10 months ago
1995
Springer
: This paper introduces an efficient hierarchical algorithm capable of simulating light transfer for complex scenes containing non-diffuse surfaces. The algorithmstemsfroma newfor...
152
click to vote
DAC
2005
ACM
16 years 7 months ago
2005
ACM
? An efficient and compact canonical form is proposed for the Boolean matching problem under permutation and complementation of variables. In addition an efficient algorithm for co...
184
click to vote
COMPLIFE
2005
Springer
16 years 3 days ago
2005
Springer
Abstract. We describe an approach to clustering the yeast protein-protein interaction network in order to identify functional modules, groups of proteins forming multi-protein comp...