Sciweavers

103 search results - page 19 / 21
» Fast placement approaches for FPGAs
Sort
View
WIDM
2004
ACM
14 years 24 days ago
XPath lookup queries in P2P networks
We address the problem of querying XML data over a P2P network. In P2P networks, the allowed kinds of queries are usually exact-match queries over file names. We discuss the exte...
Angela Bonifati, Ugo Matrangolo, Alfredo Cuzzocrea...
RT
2001
Springer
13 years 11 months ago
Decoupling Strokes and High-Level Attributes for Interactive Traditional Drawing
We present an interactive system, which allows the user to produce drawings in a variety of traditional styles. It takes as input an image and performs semi-automatic tonal modelin...
Frédo Durand, Victor Ostromoukhov, Mathieu ...
IPPS
1998
IEEE
13 years 11 months ago
Optimizing Data Scheduling on Processor-in-Memory Arrays
In the study of PetaFlop project, Processor-In-Memory array was proposed to be a target architecture in achieving 1015 floating point operations per second computing performance. ...
Yi Tian, Edwin Hsing-Mean Sha, Chantana Chantrapor...
TVLSI
2011
265views more  TVLSI 2011»
13 years 2 months ago
Decoding-Aware Compression of FPGA Bitstreams
Abstract—Bitstream compression is important in reconfigurable system design since it reduces the bitstream size and the memory requirement. It also improves the communication ba...
Xiaoke Qin, Chetan Muthry, Prabhat Mishra
ISPD
2010
ACM
207views Hardware» more  ISPD 2010»
14 years 2 months ago
FOARS: FLUTE based obstacle-avoiding rectilinear steiner tree construction
Obstacle-avoiding rectilinear Steiner minimal tree (OARSMT) construction is becoming one of the most sought after problems in modern design flow. In this paper we present FOARS, ...
Gaurav Ajwani, Chris Chu, Wai-Kei Mak