File: control

package info (click to toggle)
libmpikmeans 1.5%2Bdfsg-5
  • links: PTS, VCS
  • area: main
  • in suites: stretch
  • size: 344 kB
  • ctags: 355
  • sloc: cpp: 1,673; makefile: 150; python: 56; sh: 5
file content (93 lines) | stat: -rw-r--r-- 3,101 bytes parent folder | download
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
Source: libmpikmeans
Section: libs
Priority: extra
Maintainer: Christian Kastner <ckk@debian.org>
Build-Depends:
    debhelper (>= 9),
    dh-python,
    python-all-dev (>= 2.6.6-3~),
    cython,
    python-numpy,
    libboost-dev,
    libboost-filesystem-dev,
    libboost-program-options-dev,
Standards-Version: 3.9.8
Homepage: http://mloss.org/software/view/48/
Vcs-Git: https://anonscm.debian.org/git/debian-science/packages/libmpikmeans.git
Vcs-Browser: https://anonscm.debian.org/cgit/debian-science/packages/libmpikmeans.git
X-Python-Version: >= 2.5

Package: libmpikmeans-dev
Section: libdevel
Architecture: any
Multi-Arch: same
Depends:
    ${misc:Depends},
    libmpikmeans1 (= ${binary:Version}),
Description: Development libraries and header files for MPIKmeans
 This library uses an algorithm that yields the very same solution as standard
 k-means, even after each iteration. However, it uses triangle inequalities, and
 is much faster.
 .
 Note: MPI here does not refer to the Message Passing Interface; rather, it is
 an acronym for Max Planck Institute, where this algorithm was developed.
 .
 This package contains the header files and static libraries.

Package: libmpikmeans1
Architecture: any
Multi-Arch: same
Pre-Depends:
    ${misc:Pre-Depends},
Depends:
    ${shlibs:Depends},
    ${misc:Depends},
Suggests:
    mpikmeans-tools (= ${binary:Version}),
Description: Fast Library for k-means Clustering
 This library uses an algorithm that yields the very same solution as standard
 k-means, even after each iteration. However, it uses triangle inequalities, and
 is much faster.
 .
 Note: MPI here does not refer to the Message Passing Interface; rather, it is
 an acronym for Max Planck Institute, where this algorithm was developed.
 .
 This package contains the shared libraries.

Package: mpikmeans-tools
Architecture: any
Multi-Arch: foreign
Depends:
    ${shlibs:Depends},
    ${misc:Depends},
    libmpikmeans1 (= ${binary:Version}),
Description: Standalone applications for MPIKmeans
 This library uses an algorithm that yields the very same solution as standard
 k-means, even after each iteration. However, it uses triangle inequalities, and
 is much faster.
 .
 Note: MPI here does not refer to the Message Passing Interface; rather, it is
 an acronym for Max Planck Institute, where this algorithm was developed.
 .
 This package contains the standalone applications.

Package: python-mpikmeans
Section: python
Architecture: any
Depends:
    ${python:Depends},
    ${shlibs:Depends},
    ${misc:Depends},
    libmpikmeans1 (= ${binary:Version}),
    python-numpy,
Description: Python bindings for MPIKmeans
 This library uses an algorithm that yields the very same solution as standard
 k-means, even after each iteration. However, it uses triangle inequalities, and
 is much faster.
 .
 Note: MPI here does not refer to the Message Passing Interface; rather, it is
 an acronym for Max Planck Institute, where this algorithm was developed.
 .
 This package contains the Python bindings. Both the old, ctypes-based and the
 new, Cython-based interfaces are provided.