Sciweavers

709 search results - page 130 / 142
» Texture segmentation benchmark
Sort
View
FPGA
2005
ACM
156views FPGA» more  FPGA 2005»
14 years 3 months ago
Design of programmable interconnect for sublithographic programmable logic arrays
Sublithographic Programmable Logic Arrays can be interconnected and restored using nanoscale wires. Building on a hybrid of bottom-up assembly techniques supported by conventional...
André DeHon
FPGA
2004
ACM
145views FPGA» more  FPGA 2004»
14 years 3 months ago
Exploration of pipelined FPGA interconnect structures
In this work, we parameterize and explore the interconnect structure of pipelined FPGAs. Specifically, we explore the effects of interconnect register population, length of regist...
Akshay Sharma, Katherine Compton, Carl Ebeling, Sc...
DATE
2003
IEEE
79views Hardware» more  DATE 2003»
14 years 3 months ago
Time Budgeting in a Wireplanning Context
Wireplanning is an approach in which the timing of inputoutput paths is planned before modules are specified, synthesized or sized. If these global wires are optimally segmented ...
Jurjen Westra, Dirk-Jan Jongeneel, Ralph H. J. M. ...
SRDS
2003
IEEE
14 years 3 months ago
Group Communication Protocols under Errors
Group communication protocols constitute a basic building block for highly dependable distributed applications. Designing and correctly implementing a group communication system (...
Claudio Basile, Long Wang, Zbigniew Kalbarczyk, Ra...
EMMCVPR
2001
Springer
14 years 2 months ago
An Experimental Comparison of Min-cut/Max-flow Algorithms for Energy Minimization in Vision
After [15, 31, 19, 8, 25, 5] minimum cut/maximum flow algorithms on graphs emerged as an increasingly useful tool for exact or approximate energy minimization in low-level vision...
Yuri Boykov, Vladimir Kolmogorov