Sciweavers

2057 search results - page 15 / 412
» Quadratic placement using an improved timing model
Sort
View
SISAP
2010
IEEE
243views Data Mining» more  SISAP 2010»
13 years 4 months ago
Similarity matrix compression for efficient signature quadratic form distance computation
Determining similarities among multimedia objects is a fundamental task in many content-based retrieval, analysis, mining, and exploration applications. Among state-of-the-art sim...
Christian Beecks, Merih Seran Uysal, Thomas Seidl
IJRR
2008
107views more  IJRR 2008»
13 years 6 months ago
Caging Polygons with Two and Three Fingers
: We present algorithms for computing all placements of two and three fingers that cage a given polygonal object with n edges in the plane. A polygon is caged when it is impossible...
Mostafa Vahedi, A. Frank van der Stappen
ICDE
2002
IEEE
112views Database» more  ICDE 2002»
14 years 8 months ago
Design and Evaluation of Alternative Selection Placement Strategies in Optimizing Continuous Queries
In this paper, we design and evaluate alternative selection placement strategies for optimizing a very large number of continuous queries in an Internet environment. Two grouping ...
Jianjun Chen, David J. DeWitt, Jeffrey F. Naughton
FPGA
2010
ACM
250views FPGA» more  FPGA 2010»
14 years 3 months ago
Variation-aware placement for FPGAs with multi-cycle statistical timing analysis
Deep submicron processes have allowed FPGAs to grow in complexity and speed. However, such technology scaling has caused FPGAs to become more susceptible to the effects of process...
Gregory Lucas, Chen Dong, Deming Chen
DAC
2006
ACM
14 years 7 months ago
Architecture-aware FPGA placement using metric embedding
Since performance on FPGAs is dominated by the routing architecture rather than wirelength, we propose a new architecture-aware approach to initial FPGA placement that models the ...
Padmini Gopalakrishnan, Xin Li, Lawrence T. Pilegg...