Sciweavers

4843 search results - page 757 / 969
» The Shortcut Problem - Complexity and Approximation
Sort
View
SIAMSC
2011
153views more  SIAMSC 2011»
14 years 10 months ago
Stable Computations with Gaussian Radial Basis Functions
Abstract. Radial basis function (RBF) approximation is an extremely powerful tool for representing smooth functions in non-trivial geometries, since the method is meshfree and can ...
Bengt Fornberg, Elisabeth Larsson, Natasha Flyer
VC
2011
106views more  VC 2011»
14 years 10 months ago
Width-bounded geodesic strips for surface tiling
Abstract We present an algorithm for computing families of geodesic curves over an open mesh patch to partition the patch into strip-like segments. Specifically, the segments can ...
Joe Kahlert, Matt Olson, Hao Zhang 0002
155
Voted
MEMICS
2010
14 years 10 months ago
A Simple Topology Preserving Max-Flow Algorithm for Graph Cut Based Image Segmentation
In this paper, we propose a modification to the Boykov-Kolmogorov maximum flow algorithm [2] in order to make the algorithm preserve the topology of an initial interface. This alg...
Ondrej Danek, Martin Maska
170
Voted
REALWSN
2010
14 years 10 months ago
Visibility Levels: Managing the Tradeoff between Visibility and Resource Consumption
Pre-deployment tests of sensor networks in indoor testbeds can only deliver a very approximate view of the correctness and performance of a deployed sensor network and it is theref...
Junyan Ma, Kay Römer
126
Voted
SIAMMAX
2010
116views more  SIAMMAX 2010»
14 years 10 months ago
Acquired Clustering Properties and Solution of Certain Saddle Point Systems
Many mathematical models involve flow equations characterized by nonconstant viscosity, and a Stokes type problem with variable viscosity coefficient arises. Appropriate block diag...
M. A. Olshanskii, V. Simoncini