Sciweavers

760 search results - page 17 / 152
» Algorithms for finding clique-transversals of graphs
Sort
View
COCOON
2007
Springer
14 years 17 days ago
Improved Exact Algorithms for Counting 3- and 4-Colorings
Abstract. We introduce a generic algorithmic technique and apply it on decision and counting versions of graph coloring. Our approach is based on the following idea: either a graph...
Fedor V. Fomin, Serge Gaspers, Saket Saurabh
CIVR
2006
Springer
139views Image Analysis» more  CIVR 2006»
14 years 11 days ago
Finding People Frequently Appearing in News
Abstract. We propose a graph based method to improve the performance of person queries in large news video collections. The method benefits from the multi-modal structure of videos...
Derya Ozkan, Pinar Duygulu
UAI
2004
13 years 10 months ago
On Finding Minimal w-cutset
The complexity of a reasoning task over a graphical model is tied to the induced width of the underlying graph. It is well-known that the conditioning (assigning values) on a subs...
Bozhena Bidyuk, Rina Dechter
KDD
2009
ACM
216views Data Mining» more  KDD 2009»
14 years 9 months ago
Finding a team of experts in social networks
Given a task T , a pool of individuals X with different skills, and a social network G that captures the compatibility among these individuals, we study the problem of finding X ,...
Theodoros Lappas, Kun Liu, Evimaria Terzi
CORR
2010
Springer
112views Education» more  CORR 2010»
13 years 8 months ago
On Finding Frequent Patterns in Event Sequences
Given a directed acyclic graph with labeled vertices, we consider the problem of finding the most common label sequences ("traces") among all paths in the graph (of some...
Andrea Campagna, Rasmus Pagh