760 search results - page 71 / 152 » Algorithms for finding clique-transversals of graphs |
WWW
2008
ACM
14 years 10 months ago
2008
ACM
The rapid growth of the number of videos in YouTube provides enormous potential for users to find content of interest to them. Unfortunately, given the difficulty of searching vid...
ICCV
2007
IEEE
14 years 12 months ago
2007
IEEE
We pose robust matching with parametric and non-parametric constraints as the problem of finding a stable independent set (SIS) in an oriented graph whose vertices are all possible...
STOC
2004
ACM
14 years 10 months ago
2004
ACM
We prove the following inequality: for every positive integer n and every collection X1, . . . , Xn of nonnegative independent random variables that each has expectation 1, the pr...
CORR
2008
Springer
13 years 10 months ago
2008
Springer
This paper presents a method to find new De Bruijn cycles based on ones of lesser order. This is done by mapping a De Bruijn cycle to several vertex disjoint cycles in a De Bruijn ...
ICDE
2004
IEEE
14 years 11 months ago
2004
IEEE
Frequent structure mining (FSM) aims to discover and extract patterns frequently occurring in structural data, such as trees and graphs. FSM finds many applications in bioinformat...