Sciweavers

280 search results - page 36 / 56
» Using Determining Sets to Distinguish Kneser Graphs
Sort
View
JCT
2010
112views more  JCT 2010»
13 years 8 months ago
Annular embeddings of permutations for arbitrary genus
In the symmetric group on a set of size 2n, let P2n denote the conjugacy class of involutions with no fixed points (equivalently, we refer to these as “pairings”, since each ...
I. P. Goulden, William Slofstra
SIAMCOMP
2010
97views more  SIAMCOMP 2010»
13 years 8 months ago
Designing Network Protocols for Good Equilibria
Designing and deploying a network protocol determines the rules by which end users interact with each other and with the network. We consider the problem of designing a protocol t...
Ho-Lin Chen, Tim Roughgarden, Gregory Valiant
ACCV
2007
Springer
14 years 4 months ago
User-Guided Shape from Shading to Reconstruct Fine Details from a Single Photograph
Abstract. Many real objects, such as faces, sculptures, or low-reliefs are composed of many detailed parts that can not be easily modeled by an artist nor by 3D scanning. In this p...
Alexandre Meyer, Héctor M. Briceño, ...
IPPS
1998
IEEE
14 years 2 months ago
Meta-heuristics for Circuit Partitioning in Parallel Test Generation
In this communication Simulated Annealing and Genetic Algorithms, are applied to the graph partitioning problem. These techniques mimic processes in statistical mechanics and biol...
Consolación Gil, Julio Ortega, Antonio F. D...
AAAI
2007
14 years 3 days ago
A Kernel Approach to Comparing Distributions
We describe a technique for comparing distributions without the need for density estimation as an intermediate step. Our approach relies on mapping the distributions into a Reprod...
Arthur Gretton, Karsten M. Borgwardt, Malte J. Ras...