Sciweavers

1536 search results - page 34 / 308
» Approximately Dominating Representatives
Sort
View
LICS
2002
IEEE
14 years 19 days ago
Little Engines of Proof
The automated construction of mathematical proof is a basic activity in computing. Since the dawn of the field of automated reasoning, there have been two divergent schools of tho...
Natarajan Shankar
JUCS
2007
137views more  JUCS 2007»
13 years 7 months ago
An Approach to Polygonal Approximation of Digital Curves Based on Discrete Particle Swarm Algorithm
: An approach to polygonal approximation of regular digital curves based on PSO algorithm is presented. In this paper, each particle corresponds to a candidate solution to the poly...
Fangmin Dong, Renbin Xiao, Yifang Zhong, Yong Liu
SDM
2007
SIAM
81views Data Mining» more  SDM 2007»
13 years 9 months ago
A PAC Bound for Approximate Support Vector Machines
We study a class of algorithms that speed up the training process of support vector machines (SVMs) by returning an approximate SVM. We focus on algorithms that reduce the size of...
Dongwei Cao, Daniel Boley
EWC
2007
93views more  EWC 2007»
13 years 7 months ago
Approximation of involute curves for CAD-system processing
In numerous instances, accurate algorithms for approximating the original geometry is required. One typical example is a circle involute curve which represents the underlying geom...
Fumitaka Higuchi, Shuichi Gofuku, Takashi Maekawa,...
ESOP
2010
Springer
13 years 11 months ago
CFA2: A Context-Free Approach to Control-Flow Analysis
Abstract. In a functional language, the dominant control-flow mechanism is function call and return. Most higher-order flow analyses, including k-CFA, do not handle call and retu...
Dimitrios Vardoulakis, Olin Shivers