Sciweavers

231 search results - page 2 / 47
» On overlays and minimization diagrams
Sort
View
COMBINATORICS
2007
87views more  COMBINATORICS 2007»
13 years 5 months ago
Recognizing Cluster Algebras of Finite Type
We compute the list of all minimal 2-infinite diagrams, which are cluster algebraic analogues of extended Dynkin graphs.
Ahmet I. Seven
TCOS
2010
13 years 3 months ago
Constructing Two-Dimensional Voronoi Diagrams via Divide-and-Conquer of Envelopes in Space
We present a general framework for computing two-dimensional Voronoi diagrams of different classes of sites under various distance functions. Most diagrams mentioned in the paper ...
Ophir Setter, Micha Sharir, Dan Halperin
ICCD
2006
IEEE
125views Hardware» more  ICCD 2006»
14 years 2 months ago
Partial Functional Manipulation Based Wirelength Minimization
—In-place flipping of rectangular blocks/cells can potentially reduce the wirelength of a floorplan/placement solution without changing the chip area, In a recent work [Hao 05], ...
Avijit Dutta, David Z. Pan
GLOBECOM
2007
IEEE
13 years 11 months ago
Provider Provisioned Overlay Networks and Their Utility in DoS Defense
—The current overlay deployment model supports minimal or no involvement by ISPs in overlay deployment and operation. This model rules out a richer set of interactions between th...
Jinu Kurian, Kamil Saraç
CODES
2004
IEEE
13 years 9 months ago
Dynamic overlay of scratchpad memory for energy minimization
The memory subsystem accounts for a significant portion of the aggregate energy budget of contemporary embedded systems. Moreover, there exists a large potential for optimizing th...
Manish Verma, Lars Wehmeyer, Peter Marwedel