Sciweavers

6598 search results - page 414 / 1320
» Graph Theory with Applications
Sort
View
FOCS
2003
IEEE
16 years 2 days ago
The Complexity of Homomorphism and Constraint Satisfaction Problems Seen from the Other Side
We give a complexity theoretic classification of homomorphism problems for graphs and, more generally, relational structures obtained by restricting the left hand side structure ...
Martin Grohe
183
Voted
FOCS
2000
IEEE
15 years 11 months ago
On Clusterings - Good, Bad and Spectral
We motivate and develop a natural bicriteria measure for assessing the quality of a clustering that avoids the drawbacks of existing measures. A simple recursive heuristic is shown...
Ravi Kannan, Santosh Vempala, Adrian Vetta
NIPS
2000
15 years 8 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
161
Voted
DM
2008
82views more  DM 2008»
15 years 6 months ago
Problems and results in extremal combinatorics - II
Extremal Combinatorics is one of the central areas in Discrete Mathematics. It deals with problems that are often motivated by questions arising in other areas, including Theoreti...
Noga Alon
CORR
2006
Springer
104views Education» more  CORR 2006»
15 years 6 months ago
From Proof Nets to the Free *-Autonomous Category
Abstract. In the first part of this paper we present a theory of proof nets for full multiplicative linear logic, including the two units. It naturally extends the well-known theor...
François Lamarche, Lutz Straßburger