2292 search results - page 112 / 459 » Hierarchical approximation and localization |
135
click to vote
EUROCAST
2005
Springer
15 years 10 months ago
2005
Springer
abstract NP-hard optimization problem, in a general sense. From the observation that, intuitively, there are many connections among categorical concepts and structural complexity n...
123
click to vote
FSTTCS
2001
Springer
15 years 9 months ago
2001
Springer
Semidefinite programming based approximation algorithms, such as the Goemans and Williamson approximation algorithm for the MAX CUT problem, are usually shown to have certain perf...
267
Voted
DAC
2011
ACM
14 years 4 months ago
2011
ACM
In this paper, a new sparse approximation technique is proposed for incremental power grid analysis. Our proposed method is motivated by the observation that when a power grid net...
132
Voted
CPM
2009
Springer
15 years 11 months ago
2009
Springer
Abstract. A black box method was recently given that solves the problem of online approximate matching for a class of problems whose distance functions can be classified as being ...
141
click to vote
SGP
2003
15 years 6 months ago
2003
Point sets become an increasingly popular shape representation. Most shape processing and rendering tasks require the approximation of a continuous surface from the point data. We...