Sciweavers

140 search results - page 18 / 28
» Computing the Edit-Distance between Unrooted Ordered Trees
Sort
View
FPGA
1999
ACM
142views FPGA» more  FPGA 1999»
14 years 27 days ago
Multi-Terminal Net Routing for Partial Crossbar-Based Multi-FPGA Systems
Multi-FPGA systems are used as custom computing machines to solve compute intensive problems and also in the verification and prototyping of large circuits. In this paper, we addr...
Abdel Ejnioui, N. Ranganathan
GECCO
2000
Springer
200views Optimization» more  GECCO 2000»
14 years 6 days ago
Chemical Crossover
During chemical reactions, molecules interact to produce new molecules. Some of the reaction mechanisms are very close to the way gene combine to produce new genes. Like the class...
Hugues Bersini
IPPS
2006
IEEE
14 years 2 months ago
Concurrent counting is harder than queuing
In both distributed counting and queuing, processors in a distributed system issue operations which are organized into a total order. In counting, each processor receives the rank...
Srikanta Tirthapura, Costas Busch
RECOMB
2006
Springer
14 years 9 months ago
Detecting the Dependent Evolution of Biosequences
Abstract. A probabilistic graphical model is developed in order to detect the dependent evolution between different sites in biological sequences. Given a multiple sequence alignme...
Jeremy Darot, Chen-Hsiang Yeang, David Haussler
ICVS
2009
Springer
14 years 3 months ago
Visual Registration Method for a Low Cost Robot
Abstract— An autonomous mobile robot must face the correspondence or data association problem in order to carry out tasks like place recognition or unknown environment mapping. I...
David Aldavert, Arnau Ramisa, Ricardo Toledo, Ramo...