Sciweavers

316 search results - page 22 / 64
» Approximation algorithms for hierarchical location problems
Sort
View
ISAAC
2010
Springer
257views Algorithms» more  ISAAC 2010»
13 years 5 months ago
Approximating Minimum Bending Energy Path in a Simple Corridor
Abstract. In this paper, we consider the problem of computing a minimum bending energy path (or MinBEP) in a simple corridor. Given a simple 2D corridor C bounded by straight line ...
Jinhui Xu, Lei Xu, Yulai Xie
ICCAD
2001
IEEE
124views Hardware» more  ICCAD 2001»
14 years 4 months ago
Highly Accurate Fast Methods for Extraction and Sparsification of Substrate Coupling Based on Low-Rank Approximation
More aggressive design practices have created renewed interest in techniques for analyzing substrate coupling problems. Most previous work has focused primarily on faster techniqu...
Joe Kanapka, Jacob White
ECCV
2002
Springer
14 years 9 months ago
Hierarchical Shape Modeling for Automatic Face Localization
Many approaches have been proposed to locate faces in an image. There are, however, two problems in previous facial shape models using feature points. First, the dimension of the s...
Ce Liu, Heung-Yeung Shum, Changshui Zhang
ADHOCNOW
2008
Springer
14 years 1 months ago
Local Maximal Matching and Local 2-Approximation for Vertex Cover in UDGs
We present 1 − approximation algorithms for the maximum matching problem in location aware unit disc graphs and in growth-bounded graphs. The algorithm for unit disk graph is loc...
Andreas Wiese, Evangelos Kranakis
AAAI
1996
13 years 8 months ago
Building Steady-State Simulators via Hierarchical Feedback Decomposition
In recent years, compositional modeling and selfexplanatory simulation techniques have simplified the process of building dynamic simulators of physical systems. Building steady-s...
Nicolas F. Rouquette