Sciweavers

1949 search results - page 271 / 390
» Random graphs on surfaces
Sort
View
MST
2010
187views more  MST 2010»
14 years 11 months ago
Distributed Approximation of Capacitated Dominating Sets
We study local, distributed algorithms for the capacitated minimum dominating set (CapMDS) problem, which arises in various distributed network applications. Given a network graph...
Fabian Kuhn, Thomas Moscibroda
154
Voted
CORR
2012
Springer
229views Education» more  CORR 2012»
13 years 12 months ago
Cops and Invisible Robbers: the Cost of Drunkenness
We examine a version of the Cops and Robber (CR) game in which the robber is invisible, i.e., the cops do not know his location until they capture him. Apparently this game (CiR) h...
Athanasios Kehagias, Dieter Mitsche, Pawel Pralat
CVPR
2009
IEEE
16 years 11 months ago
Contextual Classification with Functional Max-Margin Markov Networks
We address the problem of label assignment in computer vision: given a novel 3-D or 2-D scene, we wish to assign a unique label to every site (voxel, pixel, superpixel, etc.). To...
Daniel Munoz, James A. Bagnell, Martial Hebert, Ni...
141
Voted
EMO
2001
Springer
109views Optimization» more  EMO 2001»
15 years 8 months ago
Specification of Genetic Search Directions in Cellular Multi-objective Genetic Algorithms
When we try to implement a multi-objective genetic algorithm (MOGA) with variable weights for finding a set of Pareto optimal solutions, one difficulty lies in determining appropri...
Tadahiko Murata, Hisao Ishibuchi, Mitsuo Gen
CG
2006
Springer
15 years 4 months ago
Constrained diffusion-limited aggregation in 3 dimensions
Diffusion Limited Aggregation (DLA) has usually been studied in 2 dimensions as a model of fractal growth processes such as river networks, plant branching, frost on glass, electr...
Paul D. Bourke