7930 search results - page 624 / 1586 » Greedy in Approximation Algorithms |
275
click to vote
ARITH
2009
IEEE
15 years 11 months ago
2009
IEEE
This paper deals with the design and implementation of low latency software for binary floating-point division with correct rounding to nearest. The approach we present here targe...
193
click to vote
MM
1995
ACM
15 years 10 months ago
1995
ACM
We describe a new approach to the detection and classication of scene breaks in video sequences. Our method can detect and classify a variety of scene breaks, including cuts, fade...
164
click to vote
CP
2008
Springer
15 years 9 months ago
2008
Springer
Abstract. Finding feasible points for which the proof succeeds is a critical issue in safe Branch and Bound algorithms which handle continuous problems. In this paper, we introduce...
166
click to vote
ACL
2007
15 years 8 months ago
2007
This paper proposes a novel approach to the induction of Combinatory Categorial Grammars (CCGs) by their potential affinity with the Genetic Algorithms (GAs). Specifically, CCGs...
201
click to vote
FLAIRS
2003
15 years 8 months ago
2003
Researchers studying Evolutionary Algorithms and their applications have always been confronted with the sample complexity problem. The relationship between population size and gl...