7129 search results - page 296 / 1426 » Approximation Algorithms for Treewidth |
125
click to vote
OPODIS
2008
15 years 6 months ago
2008
Abstract. We consider the following model of cellular networks. Each base station has a given finite capacity, and each client has some demand and profit. A client can be covered b...
139
click to vote
ESANN
2006
15 years 6 months ago
2006
Abstract. Feature Selection techniques usually follow some search strategy to select a suitable subset from a set of features. Most neural network growing algorithms perform a sear...
137
click to vote
UAI
2003
15 years 5 months ago
2003
In this paper, we introduce a method for approximating the solution to inference and optimization tasks in uncertain and deterministic reasoning. Such tasks are in general intract...
144
Voted
CCCG
1998
15 years 5 months ago
1998
Given a set P of n points in Rd, a fundamental problem in computational geometry is concerned with finding the smallest shape of some type that encloses all the points of P. Well-...
144
Voted
VMV
2003
15 years 5 months ago
2003
The signed distance field of a surface can effectively support many geometry processing tasks such as decimation, smoothing, and Boolean operations since it provides efficient a...