- 博客(2)
- 资源 (7)
- 收藏
- 关注
RSS订阅原创 VC6.0对话框移植到VS2005平台下
<br /> 由于要把项目从VC6.0平台转到VS2005平台下，今天早上弄了将近一个小时终于搞定了。<br />首先是一般的自定义的类，这个很好做，只需将文件拷贝到VS2005中新建的工程目录下，在工程中引入这些文件就可以了，但记得有些文件头的include可能需要修改。<br />麻烦的是VC6.0中的对话框要从VC6.0移植到VS2005中，这个是比较麻烦的，网上似乎没有比较详细的资料，参考资料中说将resource.h和XXX.rc中的相关文本拷到对应的文件中就可以了，我是这样做的，但实际还
2011-03-15 11:34:00
1012
原创 无法删除IE图标（被劫持）
<br />不知道从哪下载来的软件，其带有Internet Explorer和另外几个东西……怎删除都删除不了，即使是安全模式下亦不能将其删除，其属性是Internet Explorer的属性，打开后是某个网址，然后主页在杀毒软件的防护下就是空白了……<br /><br />解决方案如下：<br />右击桌面--属性--桌面--自定义桌面--右下角“现在清理桌面”--下一步--可以看到这个缺德的图标--只选中它再下一步就可以干掉可恶的图标了，然后在桌面上会有一个名为“清理桌面”的文件夹，里面就存放着被清理的
2010-08-21 09:47:00
371
FAST APPROXIMATE NEAREST NEIGHBORS WITH AUTOMATIC ALGORITHM CONFIGURATION
For many computer vision problems, the most time consuming component consists of nearest neighbor matching in high-dimensional spaces. There are no known exact algorithms for solving these high-dimensional problems that are faster than linear search. Approximate algorithms are known to provide large speedups with only minor loss in accuracy, but many such algorithms have been published with only minimal guidance on selecting an algorithm and its parameters for any given problem. In this paper, we describe a system that answers the question, “What is the fastest approximate nearest-neighbor algorithm for my data? ” Our system will take any given dataset and desired degree of precision and use these to automatically determine the best algorithm and parameter values. We also describe a new algorithm that applies priority search on hierarchical k-means trees, which we have found to provide the best known performance on many datasets. After testing a range of alternatives, we have found that multiple randomized k-d trees provide the best performance for other datasets. We are releasing public domain code that implements these approaches. This library provides about one order of magnitude improvement in query time over the best previously available software and provides fully automated parameter selection.
2011-03-06
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人