Sciweavers

64 search results - page 9 / 13
» Greedy wire-sizing is linear time
Sort
View
ISPD
2012
ACM
283views Hardware» more  ISPD 2012»
12 years 3 months ago
Low-power gated bus synthesis for 3d ic via rectilinear shortest-path steiner graph
In this paper, we propose a new approach for gated bus synthesis [16] with minimum wire capacitance per transaction in three-dimensional (3D) ICs. The 3D IC technology connects di...
Chung-Kuan Cheng, Peng Du, Andrew B. Kahng, Shih-H...
PODS
2011
ACM
220views Database» more  PODS 2011»
12 years 10 months ago
Maximizing conjunctive views in deletion propagation
In deletion propagation, tuples from the database are deleted in order to reflect the deletion of a tuple from the view. Such an operation may result in the (often necessary) del...
Benny Kimelfeld, Jan Vondrák, Ryan Williams
CVPR
2012
IEEE
11 years 10 months ago
Online robust image alignment via iterative convex optimization
In this paper we study the problem of online aligning a newly arrived image to previously well-aligned images. Inspired by recent advances in batch image alignment using low rank ...
Yi Wu, Bin Shen, Haibin Ling
CDB
2004
Springer
172views Database» more  CDB 2004»
14 years 26 days ago
Constraint Database Solutions to the Genome Map Assembly Problem
Abstract. Long DNA sequences have to be cut using restriction enzymes into small fragments whose lengths and/or nucleotide sequences can be analyzed by currently available technolo...
Viswanathan Ramanathan, Peter Z. Revesz
ICASSP
2010
IEEE
13 years 7 months ago
Gradient Polytope Faces Pursuit for large scale sparse recovery problems
Polytope Faces Pursuit is a greedy algorithm that performs Basis Pursuit with similar order complexity to Orthogonal Matching Pursuit. The algorithm adds one basis vector at a tim...
Aris Gretsistas, Ivan Damnjanovic, Mark D. Plumble...