2294 search results - page 323 / 459 » From Path Graphs to Directed Path Graphs |
146
click to vote
CGF
2008
15 years 2 months ago
2008
We present a reverse engineering method for constructing a surface approximation scheme whose input is a set of unorganized noisy points in space and whose output is a set of quad...
111
Voted
CVPR
1999
IEEE
16 years 4 months ago
1999
IEEE
The main question we address is: what is the minimal information required to generate closed, non-intersecting planar boundaries? For this paper we restrict ‘shape’ to this mea...
113
click to vote
TVLSI
2002
15 years 2 months ago
2002
In this paper, we propose a low-power approach to the design of embedded very long instruction word (VLIW) processor architectures based on the forwarding (or bypassing) hardware, ...
144
click to vote
EUROGP
2008
Springer
15 years 4 months ago
2008
Springer
Two prominent genetic programming approaches are the graph-based Cartesian Genetic Programming (CGP) and Linear Genetic Programming (LGP). Recently, a formal algorithm for construc...
107
click to vote
STOC
2007
ACM
16 years 2 months ago
2007
ACM
Semidefinite programs (SDP) have been used in many recent approximation algorithms. We develop a general primal-dual approach to solve SDPs using a generalization of the well-know...