Sciweavers

4255 search results - page 55 / 851
» Cover
Sort
View
CVPR
2010
IEEE
14 years 6 months ago
Covering Trees and Lower-bounds on Quadratic Assignment
Many computer vision problems involving feature correspondence among images can be formulated as an assignment problem with a quadratic cost function. Such problems are computatio...
Julian Yarkony, Charless Fowlkes, Alex Ihler
KBSE
2007
IEEE
14 years 4 months ago
Covering array sampling of input event sequences for automated gui testing
This paper describes a new automated technique to generate test cases for GUIs by using covering arrays (CAs). The key motivation is to generate long GUI event sequences that are ...
Xun Yuan, Myra B. Cohen, Atif M. Memon
FSKD
2005
Springer
101views Fuzzy Logic» more  FSKD 2005»
14 years 3 months ago
Geometrical Probability Covering Algorithm
Abstract. In this paper, we propose a novel classification algorithm, called geometrical probability covering (GPC) algorithm, to improve classification ability. On the basis of ...
Junping Zhang, Stan Z. Li, Jue Wang
ICADL
2004
Springer
162views Education» more  ICADL 2004»
14 years 3 months ago
Character Region Identification from Cover Images Using DTT
A robust character region identification approach is proposed here to deal with cover images using a differential top-hat transformation (DTT). The DTT is derived from morphologica...
Lixu Gu
STOC
2003
ACM
109views Algorithms» more  STOC 2003»
14 years 3 months ago
A new multilayered PCP and the hardness of hypergraph vertex cover
Given a k-uniform hypergraph, the Ek-Vertex-Cover problem is to find the smallest subset of vertices that intersects every hyperedge. We present a new multilayered PCP constructi...
Irit Dinur, Venkatesan Guruswami, Subhash Khot, Od...