Sciweavers

9572 search results - page 66 / 1915
» Cover Algorithms and Their Combination
Sort
View
TCS
2010
13 years 8 months ago
Non-cooperative facility location and covering games
Abstract. We study a general class of non-cooperative games coming from combinatorial covering and facility location problems. A game for k players is based on an integer programmi...
Jean Cardinal, Martin Hoefer
ICIP
1997
IEEE
14 years 2 months ago
Image replacement through texture synthesis
Photographs and images often have regions which are in some sense flawed. Often, there may be a stain or an undesired feature covering a significant portion of the image, and an a...
Homan Igehy, Lucas Pereira
EMNLP
2007
13 years 11 months ago
Recovery of Empty Nodes in Parse Structures
In this paper, we describe a new algorithm for recovering WH-trace empty nodes. Our approach combines a set of hand-written patterns together with a probabilistic model. Because t...
Denis Filimonov, Mary P. Harper
CPHYSICS
2008
64views more  CPHYSICS 2008»
13 years 10 months ago
Multibondic cluster algorithm for finite-size scaling studies of critical phenomena
For finite-size scaling studies of second-order phase transitions the critical energy range of interest is usually larger than the energy range covered by a canonical Monte Carlo ...
Bernd A. Berg, Wolfhard Janke
IPCO
2007
77views Optimization» more  IPCO 2007»
13 years 11 months ago
Mixed-Integer Vertex Covers on Bipartite Graphs
Let A be the edge-node incidence matrix of a bipartite graph G = (U, V ; E), I be a subset the nodes of G, and b be a vector such that 2b is integral. We consider the following mi...
Michele Conforti, Bert Gerards, Giacomo Zambelli