-
-
-
ImageSegment.rar
图像分割程序，采用水平集演化的思想，实现偏微分方程中的GAC模型。Image segment source code(GAC model),which adopt the idea of level set evolving.
-
Core_Java2_I_7th_Edithon.rar
... , assertions, and logging
Streams and files, the new I/O API, memory-mapped files, file locking, and character set encoders/decoders
Regular expressions using the powerful java.util.regex package
Inner classes, reflection, and dynamic proxies
...
-
LogicalParticleFiltering.rar
... for
such models and an associated logical particle filtering algorithm. Each
particle contains a logical formula that describes a set of states. The
algorithm updates the formulae as new observations are received. Since
a single particle tracks many ...
-
AtomicParsley-source-0.9.0.zip
AtomicParsley is a lightweight command line program that can read and set
iTunes-style metadata tags in MPEG-4 files & 3gp assets in 3GPP/3GPP2 files.
-
ncftp-3.2.3-src.gz
... Want filename completion? It s built-in, GNU Readline isn t necessary.
Want full-screen support? Install Ncurses if your OS s curses stinks.
NcFTP uses "passive" by default. Try "set passive off" if needed.
Yes, it s Y2K compliant.
1. But what is
-
-
problem-1716.rar
An integer interval [a,b], a < b, is a set of all consecutive integers beginning with a and ending with b.
Write a program that: finds the minimal number of elements in a set containing at least two different integers from each interval.
-
problem-2620.rar
Given set of line segments [Li , Ri] with integer coordinates of their end points. Your task is to find the minimal subset of the given set which covers segment [0,M] completely (M is a positive integer).
-
problem-2479.rar
Given a set of n integers: A={a1, a2,..., an}, we define a function d(A) as below:
t1 t2
d(A) = max{ ∑ai + ∑aj | 1 <= s1 <= t1 < s2 <= t2 <= n }
i=s1 j=s2
Your task is to calculate d(A).
-
Go To English Version 超过100万源码资源，1000万源码文件免费下载
