Sciweavers

3038 search results - page 177 / 608
» High-Speed Function Approximation
Sort
View
STOC
1995
ACM
145views Algorithms» more  STOC 1995»
15 years 9 months ago
Polynomial time approximation schemes for dense instances of NP-hard problems
We present a unified framework for designing polynomial time approximation schemes (PTASs) for “dense” instances of many NP-hard optimization problems, including maximum cut,...
Sanjeev Arora, David R. Karger, Marek Karpinski
153
Voted
WSC
2004
15 years 7 months ago
Stochastic Approximation with Simulated Annealing as an Approach to Global Discrete-Event Simulation Optimization
This paper explores an approach to global, stochastic, simulation optimization which combines stochastic approximation (SA) with simulated annealing (SAN). SA directs a search of ...
Matthew H. Jones, K. Preston White
IJCGA
2008
77views more  IJCGA 2008»
15 years 6 months ago
Bounded-Velocity Approximation of Mobile Euclidean 2-Centres
Given a set P of points (clients) in the plane, a Euclidean 2-centre of P is a set of two points (facilities) in the plane such that the maximum distance from any client to its ne...
Stephane Durocher, David G. Kirkpatrick
TIP
2008
168views more  TIP 2008»
15 years 6 months ago
A Real-Time Algorithm for the Approximation of Level-Set-Based Curve Evolution
Abstract--In this paper, we present a complete and practical algorithm for the approximation of level-set-based curve evolution suitable for real-time implementation. In particular...
Yonggang Shi, William Clement Karl
GEOINFORMATICA
1998
144views more  GEOINFORMATICA 1998»
15 years 6 months ago
Approximation-Based Similarity Search for 3-D Surface Segments
The issue of ®nding similar 3-D surface segments arises in many recent applications of spatial database systems, such as molecular biology, medical imaging, CAD, and geographic i...
Hans-Peter Kriegel, Thomas Seidl