Sciweavers

407 search results - page 22 / 82
» Recursive or iterative routing
Sort
View
FPGA
1999
ACM
142views FPGA» more  FPGA 1999»
13 years 11 months 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
SCP
2011
255views Communications» more  SCP 2011»
13 years 2 months ago
Map fusion for nested datatypes in intensional type theory
A definitional extension LNGMIt of the Calculus of Inductive Constructions (CIC), that underlies the proof assistant Coq, is presented that allows also to program with nested dat...
Ralph Matthes
ACIVS
2005
Springer
14 years 29 days ago
Cleaning and Enhancing Historical Document Images
In this paper we present a recursive algorithm for the cleaning and the enhancing of historical documents. Most of the algorithms, used to clean and enhance documents or transform ...
Ergina Kavallieratou, Hera Antonopoulou
ICCAD
2003
IEEE
219views Hardware» more  ICCAD 2003»
14 years 4 months ago
A Min-Cost Flow Based Detailed Router for FPGAs
Routing for FPGAs has been a very challenging problem due to the limitation of routing resources. Although the FPGA routing problem has been researched extensively, most algorithm...
Seokjin Lee, Yongseok Cheon, Martin D. F. Wong
IANDC
2007
151views more  IANDC 2007»
13 years 7 months ago
Transducer-based analysis of cryptographic protocols
Cryptographic protocols can be divided into (1) protocols where the protocol steps are simple from a computational point of view and can thus be modeled by simple means, for insta...
Ralf Küsters, Thomas Wilke