Sciweavers

5169 search results - page 695 / 1034
» Locality approximation using time
Sort
View
ICCAD
2004
IEEE
145views Hardware» more  ICCAD 2004»
16 years 3 months ago
Accurate estimation of global buffer delay within a floorplan
Closed formed expressions for buffered interconnect delay approximation have been around for some time. However, previous approaches assume that buffers are free to be placed anyw...
Charles J. Alpert, Jiang Hu, Sachin S. Sapatnekar,...
150
Voted
CVPR
2010
IEEE
16 years 1 months ago
A Square-Root Sampling Approach to Fast Histogram-Based Search
We present an efficient pixel-sampling technique for histogram-based search. Given a template image as a query, a typical histogram-based algorithm aims to find the location of ...
Huang-Wei Chang, Hwann-Tzong Chen
CTRSA
2009
Springer
155views Cryptology» more  CTRSA 2009»
16 years 28 days ago
Cryptanalysis of CTC2
CTC is a toy cipher designed in order to assess the strength of algebraic attacks. While the structure of CTC is deliberately weak with respect to algebraic attacks, it was claimed...
Orr Dunkelman, Nathan Keller
214
Voted
SSDBM
2009
IEEE
192views Database» more  SSDBM 2009»
16 years 26 days ago
MLR-Index: An Index Structure for Fast and Scalable Similarity Search in High Dimensions
High-dimensional indexing has been very popularly used for performing similarity search over various data types such as multimedia (audio/image/video) databases, document collectio...
Rahul Malik, Sangkyum Kim, Xin Jin, Chandrasekar R...
APPROX
2009
Springer
99views Algorithms» more  APPROX 2009»
16 years 22 days ago
Resource Minimization Job Scheduling
Abstract. Given a set J of jobs, where each job j is associated with release date rj, deadline dj and processing time pj, our goal is to schedule all jobs using the minimum possibl...
Julia Chuzhoy, Paolo Codenotti