Displaying 2 results from an estimated 2 matches for "953048".
2017 Jun 29
2
Packages for Learning Algorithm Independent Branch and Bound for Feature Selection
I am looking for packages that can run a branch-and-bound algorithm to
maximize a distance measure (such as Bhattacharyya or Mahalanobis) on a set
of features.
I would like this to be learning algorithm independent, so that the method
just looks at the features, and selects the subset of a user-defined size
that maximizes a distance criteria such as those stated above.
Can anyone give some
2005 Oct 11
3
dovecot won't launch
...ENYWRITE, 3, 0x31000) = 0x4004e000
close(3) = 0
open("/lib/libcrypto.so.4", O_RDONLY) = 3
read(3, "\177ELF\1\1\1\0\0\0\0\0\0\0\0\0\3\0\3\0\1\0\0\0P\251\2"...,
512) = 512
fstat64(3, {st_mode=S_IFREG|0755, st_size=935112, ...}) = 0
old_mmap(NULL, 953048, PROT_READ|PROT_EXEC, MAP_PRIVATE|
MAP_DENYWRITE, 3, 0) = 0x40051000
old_mmap(0x40125000, 69632, PROT_READ|PROT_WRITE, MAP_PRIVATE|
MAP_FIXED|MAP_DENYWRITE, 3, 0xd3000) = 0x40125000
old_mmap(0x40136000, 15064, PROT_READ|PROT_WRITE, MAP_PRIVATE|
MAP_FIXED|MAP_ANONYMOUS, -1, 0) = 0x40136000
close(...