337 search results - page 24 / 68 » Computational complexity of weighted splitting schemes on pa... |
AI
2011
Springer
13 years 2 months ago
2011
Springer
The paper focuses on developing effective importance sampling algorithms for mixed probabilistic and deterministic graphical models. The use of importance sampling in such graphi...
ISHPC
1997
Springer
13 years 12 months ago
1997
Springer
Abstract. Writing e cient iterative solvers for irregular, sparse matrices in HPF is hard. The locality in the computations is unclear, and for e ciency we use storage schemes that...
ICN
2005
Springer
14 years 1 months ago
2005
Springer
Input Queued switches have been very well studied in the recent past. The Maximum Weight Matching (MWM) algorithm is known to deliver 100% throughput under any admissible traffic. ...
ISCAS
2007
IEEE
14 years 2 months ago
2007
IEEE
— Searching for an efficient summarization of multi-channel electroencephalogram (EEG) behavior is a challenging signal analysis problem. Recently, parallel factor analysis (PAR...
SPAA
2006
ACM
14 years 1 months ago
2006
ACM
One of the fundamental trade-offs in compact routing schemes is between the space used to store the routing table on each node and the stretch factor of the routing scheme – th...