1321 search results - page 127 / 265 » Quadratic forms on graphs |
CCCG
2003
14 years 11 months ago
2003
We introduce the concept of a constrained pointed pseudo-triangulation TG of a point set S with respect to a pointed planar straight line graph G = (S, E). For the case that G for...
COMGEO
2002
ACM
14 years 9 months ago
2002
ACM
A fractal construction shows that, for any > 0, the -skeleton of a point set can have arbitrarily large dilation: (nc ), where c is a constant depending on and going to zero ...
APLAS
2005
ACM
15 years 3 months ago
2005
ACM
This paper presents a novel method to construct a dynamic single assignment (DSA) form of array-intensive, pointer-free C programs (or in any other procedural language). A program ...
106
click to vote
NECO
2011
14 years 5 months ago
2011
Selection of an optimal estimator typically relies on either supervised training samples (pairs of measurements and their associated true values), or a prior probability model for...
162
click to vote
SIGMOD
2008
ACM
15 years 10 months ago
2008
ACM
The proliferation of network data in various application domains has raised privacy concerns for the individuals involved. Recent studies show that simply removing the identities ...