Sciweavers

968 search results - page 10 / 194
» A faster implementation of APlace
Sort
View
OOPSLA
2009
Springer
14 years 4 months ago
Minimizing dependencies within generic classes for faster and smaller programs
Generic classes can be used to improve performance by allowing compile-time polymorphism. But the applicability of compile-time polymorphism is narrower than that of runtime polym...
Dan Tsafrir, Robert W. Wisniewski, David F. Bacon,...
ISSTA
2004
ACM
14 years 3 months ago
Faster constraint solving with subtypes
Constraints in predicate or relational logic can be translated into boolean logic and solved with a SAT solver. For faster solving, it is common to exploit the typing of predicate...
Jonathan Edwards, Daniel Jackson, Emina Torlak, Vi...
ASPDAC
2005
ACM
107views Hardware» more  ASPDAC 2005»
13 years 11 months ago
Making fast buffer insertion even faster via approximation techniques
Abstract— As technology scales to 0.13 micron and below, designs are requiring buffers to be inserted on interconnects of even moderate length for both critical paths and fixing...
Zhuo Li, Cliff C. N. Sze, Charles J. Alpert, Jiang...
ICIP
2007
IEEE
14 years 4 months ago
Sparse Gradient Image Reconstruction Done Faster
In a wide variety of imaging applications (especially medical imaging), we obtain a partial set or subset of the Fourier transform of an image. From these Fourier measurements, we...
Ray Maleh, Anna C. Gilbert, Martin J. Strauss
WEA
2004
Springer
85views Algorithms» more  WEA 2004»
14 years 3 months ago
Faster Deterministic and Randomized Algorithms on the Homogeneous Set Sandwich Problem
A homogeneous set is a non-trivial, proper subset of a graph’s vertices such that all its elements present exactly the same outer neighborhood. Given two graphs, G1(V, E1), G2(V,...
Celina M. Herrera de Figueiredo, Guilherme Dias da...