40 search results - page 2 / 8 » Combinatorial Laplacian of the Matching Complex |
90
Voted
SWAT
2004
Springer
15 years 5 months ago
2004
Springer
For a collection F of d-variate piecewise linear functions of overall combinatorial complexity n, the lower envelope E(F) of F is the pointwise minimum of these functions. The min...
100
click to vote
PR
2008
14 years 11 months ago
2008
The spectrum of a graph has been widely used in graph theory to characterise the properties of a graph and extract information from its structure. It has also been employed as a g...
103
Voted
EMNLP
2011
13 years 11 months ago
2011
We present a simple objective function that when optimized yields accurate solutions to both decipherment and cognate pair identification problems. The objective simultaneously s...
72
Voted
FOCS
2009
IEEE
15 years 6 months ago
2009
IEEE
Abstract— Applications in complex systems such as the Internet have spawned recent interest in studying situations involving multiple agents with their individual cost or utility...
121
click to vote
ALT
2010
Springer
14 years 12 months ago
2010
Springer
This paper is concerned with the combinatorial structure of concept classes that can be learned from a small number of examples. We show that the recently introduced notion of recu...