2254 search results - page 195 / 451 » Computing the minimal covering set |
151
click to vote
EOR
2010
15 years 6 months ago
2010
Given an undirected graph G = (V, E) with a set V of vertices and a set E of edges, the graph coloring problem consists of partitioning all vertices into k independent sets and th...
165
click to vote
MOR
2006
15 years 6 months ago
2006
In multicriteria optimization, several objective functions, conflicting with each other, have to be minimized simultaneously. We propose a new efficient method for approximating t...
151
click to vote
DAC
1999
ACM
16 years 7 months ago
1999
ACM
? The economic viability of the reusable core-based design paradigm depends on the development of techniques for intellectual property protection. We introduce the first dynamic wa...
195
click to vote
EMMCVPR
2003
Springer
15 years 12 months ago
2003
Springer
Abstract. In this paper we propose a new variational framework for image segmentation that incorporates the information of expected shape and a few points on the boundary into geod...
224
click to vote
JCSS
2008
15 years 6 months ago
2008
We use techniques from sample-complexity in machine learning to reduce problems of incentive-compatible mechanism design to standard algorithmic questions, for a broad class of re...