3211 search results - page 603 / 643 » On the Grundy Number of a Graph |
171
click to vote
SODA
2012
ACM
13 years 8 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...
180
click to vote
FCT
2009
Springer
16 years 21 days 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...
186
click to vote
CVPR
2009
IEEE
17 years 1 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...
147
click to vote
CVPR
2008
IEEE
16 years 8 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...
186
click to vote
ICCV
2007
IEEE
16 years 8 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...