搜索结果: 1-7 共查到“计算机科学技术 beyond”相关记录7条 . 查询时间(0.187 秒)
第13届IEEE可视光谱感知研讨会（13th IEEE Workshop on Perception Beyond the Visible Spectrum）
第13届 IEEE可视光谱感知 研讨会
2017/6/22
The objective of this workshop is to highlight cutting edge advances and state-of-the-art work being made in the exponentially growing field of PBVS (previously OTCBVS) along its three main axes: Algo...
2017超越图像网大规模视觉识别挑战研讨会（Workshop on Beyond ImageNet Large Scale Visual Recognition Challenge）
2017年 超越图像网大规模视觉识别挑战 研讨会
2017/6/22
The workshop will mark the last of the ImageNet Challenge competitions, and focus on unanswered questions and directions for the future. The workshop will 1) present current results on the challenge c...
We describe a symbolic heap abstraction that unifies reasoning about arrays, pointers, and scalars, and we define a fluid update operation on this symbolic heap that relaxes the dichotomy between stro...
Beyond information extraction:The role of ontology in military report processing
ontology information extraction military report ontological process information visualization
2015/7/30
Information extraction tools like SMES transform natural language into formal representation, e.g. into feature structures. Doing so, these tools exploit and apply linguistic knowledge about the synta...
Domain Extension for MACs Beyond the Birthday Barrier.
Domain Extension MACs Birthday Barrier.
2012/12/3
Given an n-bit to n-bitMAC (e.g., a fixed key blockcipher) withMAC security ε against q queries, we design a variable-length MAC achieving MAC security O(εq poly(n)) against queries of total length qn...
Software Project Success: Moving Beyond Failure
Software Project Success Moving Beyond Failure
2010/9/21
Success and failure in software projects appear to be difficult to define. While there is a consensus around the prevalence of project failure, new projects seem destined to repeat past mistakes. This...
Paths Beyond Local Search: A Tight Bound for Randomized Fixed-Point Computation
Local Search:Tight Bound Randomized Fixed-Point Computation
2012/12/3
In 1983, Aldous proved that randomization can speedup local search. For example, it reduces the query complexity of local search over grid [1 : n]d from Θ(nd−1) to O(d1/2nd/2). It remains open w...