Sciweavers

7150 search results - page 33 / 1430
» An Approximation Algorithm for Approximation Rank
Sort
View
97
Voted
ICPR
2008
IEEE
15 years 7 months ago
An online polygonal approximation of digital signals and curves with Dynamic Programming algorithm
A fast online algorithm was developed for polygonal approximation of signals and curves with a minimum number of line segments for a given constraint on the standard deviation of ...
Alexander Kolesnikov
AAIM
2007
Springer
127views Algorithms» more  AAIM 2007»
15 years 6 months ago
An Improved Approximation Algorithm for Maximum Edge 2-Coloring in Simple Graphs
We present a polynomial-time approximation algorithm for legally coloring as many edges of a given simple graph as possible using two colors. It achieves an approximation ratio of...
Zhi-Zhong Chen, Ruka Tanahashi
VLDB
2001
ACM
82views Database» more  VLDB 2001»
15 years 4 months ago
Supporting Incremental Join Queries on Ranked Inputs
This paper investigates the problem of incremental joins of multiple ranked data sets when the join condition is a list of arbitrary user-defined predicates on the input tuples. ...
Apostol Natsev, Yuan-Chi Chang, John R. Smith, Chu...
SIGIR
1999
ACM
15 years 4 months ago
Comparing the Performance of Database Selection Algorithms
Abstract We compare the performance of two database selection algorithms reported in the literature. Their performance is compared using a common testbed designed specifically for ...
James C. French, Allison L. Powell, James P. Calla...
83
Voted
STOC
2005
ACM
105views Algorithms» more  STOC 2005»
16 years 23 days ago
Every 2-CSP allows nontrivial approximation
Johan Håstad