Sciweavers

1605 search results - page 249 / 321
» On Partitional Labelings of Graphs
Sort
View
115
Voted
IJCAI
2001
15 years 4 months ago
Backbones in Optimization and Approximation
We study the impact of backbones in optimization and approximation problems. We show that some optimization problems like graph coloring resemble decision problems, with problem h...
John K. Slaney, Toby Walsh
97
Voted
NIPS
2000
15 years 4 months ago
Second Order Approximations for Probability Models
In this paper, we derive a second order mean field theory for directed graphical probability models. By using an information theoretic argument it is shown how this can be done in...
Hilbert J. Kappen, Wim Wiegerinck
103
Voted
CLEIEJ
2008
72views more  CLEIEJ 2008»
15 years 2 months ago
Measuring Contribution of HTML Features in Web Document Clustering
Documents in HTML format have many features to analyze, from the terms in special sections to the phrases that appear in the whole document. However, it is important to decide whi...
Esteban Meneses, Oldemar Rodríguez-Rojas
96
Voted
DISOPT
2008
113views more  DISOPT 2008»
15 years 2 months ago
The inverse 1-median problem on a cycle
Abstract. Let the graph G = (V, E) be a cycle with n + 1 vertices, nonnegative vertex weights and positive edge lengths. The inverse 1-median problem on a cycle consists in changin...
Rainer E. Burkard, Carmen Pleschiutschnig, Jianzho...
ARSCOM
2006
81views more  ARSCOM 2006»
15 years 2 months ago
A Counting of the minimal realizations of the posets of dimension two
The posets of dimension 2 are those posets whose minimal realizations have two elements, that is, which may be obtained as the intersection of two of their linear extensions. Gall...
Pierre Ille, Jean-Xavier Rampon