6315 search results - page 367 / 1263 » Approximating Solution Structure |
174
click to vote
WG
2007
Springer
16 years 28 days ago
2007
Springer
Abstract. We present hardness results, approximation heuristics, and exact algorithms for bottleneck labeled optimization problems arising in the context of graph theory. This long...
189
click to vote
ICES
2003
Springer
16 years 23 hour ago
2003
Springer
This paper presents a methodology to design optimized electronic systems from high abstraction level descriptions. The methodology uses Genetic Programming in addition to high-leve...
160
click to vote
DASFAA
2004
IEEE
15 years 10 months ago
2004
IEEE
Abstract. We consider the problem of accurately estimating the number of approximate XML answers for a given query, and propose an efficient method that (1) accurately computes sel...
182
click to vote
COMGEO
2006
ACM
15 years 6 months ago
2006
ACM
An algorithm is proposed for the simultaneous computation of all Minkowski functionals (except for the volume) of sets from the convex ring in Rd discretized with respect to a give...
282
click to vote
CVPR
2011
IEEE
15 years 2 months ago
2011
IEEE
We propose a new family of non-submodular global energy functions that still use submodularity internally to couple edges in a graph cut. We show it is possible to develop an efï¬...