Sciweavers

62 search results - page 8 / 13
» Induced trees in triangle-free graphs
Sort
View
ICCV
2011
IEEE
12 years 7 months ago
Discriminative Learning of Relaxed Hierarchy for Large-scale Visual Recognition
In the real visual world, the number of categories a classifier needs to discriminate is on the order of hundreds or thousands. For example, the SUN dataset [24] contains 899 sce...
Tianshi Gao, Daphne Koller
CDC
2009
IEEE
126views Control Systems» more  CDC 2009»
14 years 2 days ago
H2 performance of agreement protocol with noise: An edge based approach
— This work presents an H2 performance analysis of the agreement protocol in the presence of noise. The agreement protocol is first transformed into an equivalent system induced...
Daniel Zelazo, Mehran Mesbahi
UAI
2004
13 years 8 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
COMBINATORICA
2006
137views more  COMBINATORICA 2006»
13 years 7 months ago
Extremal Problems For Transversals In Graphs With Bounded Degree
We introduce and discuss generalizations of the problem of independent transversals. Given a graph property R, we investigate whether any graph of maximum degree at most d with a ...
Tibor Szabó, Gábor Tardos
AAIM
2009
Springer
118views Algorithms» more  AAIM 2009»
14 years 1 months ago
A More Relaxed Model for Graph-Based Data Clustering: s-Plex Editing
We introduce the s-Plex Editing problem generalizing the well-studied Cluster Editing problem, both being NP-hard and both being motivated by graph-based data clustering. Instead o...
Jiong Guo, Christian Komusiewicz, Rolf Niedermeier...