520 search results - page 87 / 104 » New Complexity Results for Classical Planning Benchmarks |
ACL
2010
13 years 5 months ago
2010
Name ambiguity problem has raised urgent demands for efficient, high-quality named entity disambiguation methods. In recent years, the increasing availability of large-scale, rich...
CVPR
2011
IEEE
13 years 3 months ago
2011
IEEE
Nearly every structured prediction problem in computer vision requires approximate inference due to large and complex dependencies among output labels. While graphical models prov...
MICAI
2007
Springer
14 years 1 months ago
2007
Springer
Instance-based learning algorithms are widely used due to their capacity to approximate complex target functions; however, the performance of this kind of algorithms degrades signi...
CHES
2005
Springer
14 years 27 days ago
2005
Springer
Embedded devices implementing cryptographic services are the result of a trade-off between cost, performance and security. Aside from flaws in the protocols and the algorithms us...
ECCV
2010
Springer
13 years 12 months ago
2010
Springer
Abstract. Gradient-domain compositing is an essential tool in computer vision and its applications, e.g., seamless cloning, panorama stitching, shadow removal, scene completion and...