3211 search results - page 603 / 643 » On the Grundy Number of a Graph |
SODA
2012
ACM
11 years 10 months ago
2012
ACM
The Densest k-subgraph problem (i.e. find a size k subgraph with maximum number of edges), is one of the notorious problems in approximation algorithms. There is a significant g...
FCT
2009
Springer
14 years 2 months ago
2009
Springer
Suppose that we are given a set of n elements d of which are “defective”. A group test can check for any subset, called a pool, whether it contains a defective. It is well know...
CVPR
2009
IEEE
15 years 3 months ago
2009
IEEE
The matching and retrieval of 2D shapes is an important
challenge in computer vision. A large number of shape
similarity approaches have been developed, with the main
focus bein...
CVPR
2008
IEEE
14 years 9 months ago
2008
IEEE
Typical content-based image retrieval (CBIR) solutions with regular Euclidean metric usually cannot achieve satisfactory performance due to the semantic gap challenge. Hence, rele...
ICCV
2007
IEEE
14 years 9 months ago
2007
IEEE
In this paper we present an empirical study of object category recognition using generalized samples and a set of sequential tests. We study 33 categories, each consisting of a sm...