Sciweavers

16504 search results - page 3047 / 3301
» New Problems, New Solutions
Sort
View
FPGA
2007
ACM
163views FPGA» more  FPGA 2007»
16 years 26 days ago
Improved SAT-based Boolean matching using implicants for LUT-based FPGAs
Boolean matching (BM) is a widely used technique in FPGA resynthesis and architecture evaluation. In this paper we present several improvements to the recently proposed SAT-based ...
Jason Cong, Kirill Minkovich
GECCO
2007
Springer
167views Optimization» more  GECCO 2007»
16 years 26 days ago
An improved restricted growth function genetic algorithm for the consensus clustering of retinal nerve fibre data
This paper describes an extension to the Restricted Growth Function grouping Genetic Algorithm applied to the Consensus Clustering of a retinal nerve fibre layer data-set. Consens...
Stephen Swift, Allan Tucker, Jason Crampton, David...
GECCO
2007
Springer
192views Optimization» more  GECCO 2007»
16 years 26 days ago
On the runtime analysis of the 1-ANT ACO algorithm
The runtime analysis of randomized search heuristics is a growing field where, in the last two decades, many rigorous results have been obtained. These results, however, apply pa...
Benjamin Doerr, Frank Neumann, Dirk Sudholt, Carst...
IBPRIA
2007
Springer
16 years 26 days ago
Dimensionless Monocular SLAM
Abstract. It has recently been demonstrated that the fundamental computer vision problem of structure from motion with a single camera can be tackled using the sequential, probabil...
Javier Civera, Andrew J. Davison, J. M. M. Montiel
ISVC
2007
Springer
16 years 25 days ago
Boosting with Temporal Consistent Learners: An Application to Human Activity Recognition
We present a novel boosting algorithm where temporal consistency is addressed in a short-term way. Although temporal correlation of observed data may be an important cue for classi...
Pedro Canotilho Ribeiro, Plinio Moreno, José...
« Prev « First page 3047 / 3301 Last » Next »