107 search results - page 14 / 22 » Eigenvalues of the derangement graph |
148
click to vote
CVPR
2003
IEEE
16 years 8 months ago
2003
IEEE
We consider the problem of segmenting an image into foreground and background, with foreground containing solely objects of interest known a priori. We propose an integration mode...
156
click to vote
INFOCOM
2007
IEEE
16 years 1 months ago
2007
IEEE
— We focus on efficient protocols that enhance a network with topology awareness. We discuss centralized algorithms with provable performance, and introduce decentralized asynch...
169
Voted
COMBINATORICA
2007
15 years 6 months ago
2007
We derive a sufficient condition for a sparse graph G on n vertices to contain a copy of a tree T of maximum degree at most d on (1 − )n vertices, in terms of the expansion prop...
186
Voted
FOCS
2006
IEEE
16 years 22 days ago
2006
IEEE
Spin systems are a general way to describe local interactions between nodes in a graph. In statistical mechanics, spin systems are often used as a model for physical systems. In c...
201
click to vote
ICALP
2007
Springer
16 years 25 days ago
2007
Springer
Abstract. We deal with two intimately related subjects: quasi-randomness and regular partitions. The purpose of the concept of quasi-randomness is to measure how much a given graph...