课题基金 / 基金详情

Studies on Realistic Solutions to Theoretically Hard Problems

Studies on Realistic Solutions to Theoretically Hard Problems
理论难题的现实解决方案研究
批准号:
10205207
负责人:
ASANO Tetsuo
金额:
$9.15万
依托单位国家:
日本
项目类别:
Grant-in-Aid for Scientific Research on Priority Areas (B)
财政年份:
1998
资助国家:
日本
项目状态:
已结题
起止时间:
1998 至 2000

项目摘要

项目成果

ASANO Tetsuo的其他基金

相似基金

相关文献

中文摘要
翻译
在这项研究中,我们研究了几个问题,这些问题在算法理论中流行的传统渐近分析框架内被认为是难以计算的。更具体地说,我们研究了最优印刷网点图案的设计问题和聚类问题。对于前一个问题,我们注意到差异理论可以应用于这个问题。对差异理论进行了严格的研究,并取得了许多重要的理论成果。将其与图论中的匹配概念相结合,成功地提高了解的性能。由于我们也取得了令人满意的实验结果,我们打算将结果提交给一些期刊。针对聚类问题,我们将一种算法方法应用到图像查询系统中,在图像数据库上取得了优于传统方法的良好实验结果。我们计划将结果总结成一篇论文,在不久的将来提交给一些国际期刊。
英文摘要
In this study we have been engaged in several problems which were thought to be computationally Hard within the traditional framework of asymptotic analysis popular in the theory of algorithms. More concretely, we have studied the problem of designing optimal dot patterns for printing and that of clustering. For the former problem, we have noticed that the discrepancy theory can be applied to the problem. The discrepancy theory has been rigorously studied and is full of important theoretical results. Combining it with the notion of matching in the graph theory, we have succeeded in improving the performance of the solutions obtained. Since we also had satisfactory experimental results, we intend to submit the result to some journal. For the problem of clustering, we have applied an algorithmic approach to image query system On image database with good experimental results that exceed results by traditional Approaches. We are planning to summarize the results in a paper to be submitted to some International journal in near future.
期刊论文(25)
专著(0)
科研奖励(0)
会议论文
S. C. Nandy, T. Harayama, T. Asano: "Dynamically maintaining the widest k-dense corridor"Theoretical Computer Science. 255. 627-639 (2001)
S.C. Nandy、T. Harayama、T. Asano:“动态维持最宽的 k 密集走廊”理论计算机科学。
DOI: --
发表时间:
期刊:
影响因子: --
作者: []
通讯作者:
T. Asano: "Effective Use of Geometric Information for Clustering and Related Topics"IEICE Trans. on Fundamentals. (2000)
T. Asano:“有效利用几何信息进行聚类及相关主题”IEICE Trans。
DOI: --
发表时间:
期刊:
影响因子: --
作者: []
通讯作者:
今井、室田、浅野、茨木、小島: "離散構造とアルゴリズムV" 近代科学社, 250 (1998)
Imai、Murota、Asano、Ibaraki、Kojima:“离散结构和算法 V”Kindai Kagakusha,250(1998)
DOI: --
发表时间:
期刊:
影响因子: --
作者: []
通讯作者:
T. Asano, D. Z. Chen, N. Katoh, and T. Tokuyama: "Efficient Algorithms for Optimization-based Image Segmentation"11, 2. 145-166 (2001)
T. Asano、D. Z. Chen、N. Katoh 和 T. Tokuyama:“基于优化的图像分割的高效算法”11, 2. 145-166 (2001)
DOI: --
发表时间:
期刊:
影响因子: --
作者: []
通讯作者:
25
    Development of Algorithmic Paradigms on Memory-Constrained Computation
    Algorithms for Geometric Computational Problems Considering Constraints from Practice and Their Applications
    Formulating Digital Halftoning of Continuous-tone Images As Optimization Problem with Analysis of its Computational Complexity
    A Study on Computational Complexity and Efficient Implementation of Region Segmentation Problem of an Image under Various criteria
    海外基金