1237 search results - page 100 / 248 » Partitions and the Fermi-Dirac Distribution |
104
click to vote
APPROX
2006
Springer
15 years 4 months ago
2006
Springer
In the minimum entropy set cover problem, one is given a collection of k sets which collectively cover an n-element ground set. A feasible solution of the problem is a partition o...
129
click to vote
EUROPAR
2009
Springer
14 years 10 months ago
2009
Springer
Abstract. Point matching is crucial for many computer vision applications. Establishing the correspondence between a large number of data points is a computationally intensive proc...
117
click to vote
ICCAD
2009
IEEE
14 years 10 months ago
2009
IEEE
A parallel computing approach for large-scale SPICE-accurate circuit simulation is described that is based on a new preconditioned iterative solver. The preconditioner involves the...
133
click to vote
ICPP
2009
IEEE
14 years 10 months ago
2009
IEEE
There are two popular parallel I/O programming styles used by modern scientific computational applications: unique-file and shared-file. Unique-file I/O usually gives satisfactory ...
ICASSP
2011
IEEE
14 years 4 months ago
2011
IEEE
This paper presents several watermarking methods preventing the estimation of the secret key by an adversary. The constraints for secure embedding using distribution matching, whe...