74 search results - page 11 / 15 » Algorithms for Generating Convex Sets in Acyclic Digraphs |
106
click to vote
FPGA
2007
ACM
15 years 6 months ago
2007
ACM
The application-specific multiprocessor System-on-a-Chip is a promising design alternative because of its high degree of flexibility, short development time, and potentially high ...
GD
2005
Springer
15 years 5 months ago
2005
Springer
Most graph layout algorithms treat nodes as points. The problem of node overlap removal is to adjust the layout generated by such methods so that nodes of non-zero width and height...
75
Voted
CCCG
2006
15 years 1 months ago
2006
A flip or edge-replacement is considered as a transformation by which one edge e of a geometric object is removed and an edge f (f = e) is inserted such that the resulting object ...
111
Voted
BMVC
2000
15 years 1 months ago
2000
The hybrid Radon-Fourier technique has been proposed for the discrimination and tracking of deforming and compound targets. The current work investigates the technique's uniq...
OOPSLA
2010
Springer
14 years 10 months ago
2010
Springer
Given a high-level specification and a low-level programming language, our goal is to automatically synthesize an efficient program that meets the specification. In this paper,...