-
MaxEnt-master
最大熵模型简单实现 这是别人的 仅供借鉴 可以用 亲身试用(Maximum Entropy model is simple to achieve)
- 2015-04-17 16:00:39下载
- 积分:1
-
hufajieshao
说明: 安可美丽是一个安卓和淘宝手机网站结合的洗发护发产品介绍项目,应用内本身有一些信息,然后宝贝详情页直接转跳到淘宝的手机页面,另外自带基于ThinkPHP的web服务端和sql数据库。(Ancomay is a shampoo and hair care product introduction project that combines Android and Taobao mobile website. There are some information in the application itself. Then the Baby Details page jumps directly to Taobao mobile page. In addition, it brings its own ThinkPHP-based web server and SQL database.)
- 2020-06-16 22:00:01下载
- 积分:1
-
frameCanvas
J2ME手机游戏的矿架程序,很有用的啊,大家快点下载吧(J2ME mobile phone games Mine F procedures, a very useful ah, we quickly download it)
- 2006-08-31 16:43:46下载
- 积分:1
-
android 图片高斯图片模糊算法
android 图片高斯图片模糊算法
- 2015-06-16下载
- 积分:1
-
registry
registry
- 2022-02-05 20:27:51下载
- 积分:1
-
lexicalAnalysisUsingRegex
Lexical Analysis, in Compilers
- 2014-11-05 18:03:54下载
- 积分:1
-
在网上下的eclipse abator插件自感觉不好用,
自已写了一个
基于oracle的,支持生成序列,pojo sqlmap.xml,dao dao...
在网上下的eclipse abator插件自感觉不好用,
自已写了一个
基于oracle的,支持生成序列,pojo sqlmap.xml,dao daointerface,生成字段的注释
四个基本方法,增删改查,
写的时候基于oracle11的,低版本的可能在到得字段注释
的地方会不兼容,自已改改或不加注释就可以了 -Under the Internet plug-ins from the eclipse abator feel bad use, self-written an oracle-based, pro-generated sequences, pojo sqlmap.xml, dao daointerface, generating field notes four basic methods, additions or deletions to change the investigation, written When oracle11 based, low-version may be a place to get the field notes would be incompatible change themselves to change with or without annotations can be a
- 2022-10-03 15:55:04下载
- 积分:1
-
算术编码
算术 java 编码使用 java 编程
- 2022-06-11 15:26:09下载
- 积分:1
-
本人写的一个简单VCD租赁系统,需JDK1.5.0编译,main()函数在maininterface.java文件中。...
本人写的一个简单VCD租赁系统,需JDK1.5.0编译,main()函数在maininterface.java文件中。-I wrote a simple VCD rental system, the need JDK1.5.0 compiler, main () function in maininterface.java document.
- 2023-05-20 14:05:03下载
- 积分:1
-
TREE_INT
Tree AVL
In an AVL tree, the heights of the two child subtrees of any node differ by at most one if at any time they differ by more than one, rebalancing is done to restore this property. Lookup, insertion, and deletion all take O(log n) time in both the average and worst cases, where n is the number of nodes in the tree prior to the operation. Insertions and deletions may require the tree to be rebalanced by one or more tree rotations.
- 2014-12-05 02:27:12下载
- 积分:1