Sciweavers

3708 search results - page 92 / 742
» Approximating Betweenness Centrality
Sort
View
110
Voted
CAD
2006
Springer
15 years 20 days ago
Cone spline approximation via fat conic spline fitting
Fat conic section and fat conic spline are defined. With well established properties of fat conic splines, the problem of approximating a ruled surface by a tangent smooth cone sp...
Xunnian Yang, Weiping Yang
109
Voted
CGF
2005
138views more  CGF 2005»
15 years 15 days ago
Approximation of a Variable Density Cloud of Points by Shrinking a Discrete Membrane
This paper describes a method to obtain a closed surface that approximates a general 3D data point set with non-uniform density. Aside from the positions of the initial data point...
Jordi Esteve, Pere Brunet, Alvar Vinacua
105
Voted
DASFAA
2009
IEEE
136views Database» more  DASFAA 2009»
15 years 7 months ago
A Two-Tire Index Structure for Approximate String Matching with Block Moves
Many applications need to solve the problem of approximate string matching with block moves. It is an NP-Complete problem to compute block edit distance between two strings. Our go...
Bin Wang, Long Xie, Guoren Wang
116
Voted
SIAMJO
2011
14 years 7 months ago
Approximating Semidefinite Packing Programs
In this paper we define semidefinite packing programs and describe an algorithm to approximately solve these problems. Semidefinite packing programs arise in many applications s...
Garud Iyengar, David J. Phillips, Clifford Stein
167
Voted
APPROX
2011
Springer
284views Algorithms» more  APPROX 2011»
14 years 19 days ago
On Approximating the Number of Relevant Variables in a Function
In this work we consider the problem of approximating the number of relevant variables in a function given query access to the function. Since obtaining a multiplicative factor ap...
Dana Ron, Gilad Tsur