6409 search results - page 1121 / 1282 » A Computational Algorithm for Origami Design |
107
click to vote
MM
2009
ACM
15 years 6 months ago
2009
ACM
Nowadays, the issue of near-duplicate video matching has been extensively studied. However, transformation, which is one of the major causes of near-duplicates, has been little di...
DATE
2000
IEEE
15 years 6 months ago
2000
IEEE
Designs which do not fully utilize their arithmetic datapath components typically exhibit a significant overhead in power consumption. Whenever a module performs an operation who...
132
click to vote
ISSS
2000
IEEE
15 years 6 months ago
2000
IEEE
This paper addresses the problem of estimating lower bounds on the power consumption in scheduled data flow graphs with a fixed number of allocated resources prior to binding. T...
CP
2000
Springer
15 years 6 months ago
2000
Springer
Abstract. This paper presents an experimental investigation of the following questions: how does the averagecase complexity of random 3-SAT, understood as a function of the order (...
124
click to vote
VLSID
1999
IEEE
15 years 6 months ago
1999
IEEE
Recently Lillis, et al. presented an elegant dynamic programming approach to RC interconnect delay optimization through driver sizing, repeater insertion, and, wire sizing which e...