361 search results - page 49 / 73 » Relaxed Gabriel Graphs |
115
click to vote
ICML
2004
IEEE
16 years 2 months ago
2004
IEEE
In many application domains there is a large amount of unlabeled data but only a very limited amount of labeled training data. One general approach that has been explored for util...
123
Voted
FOCS
2006
IEEE
15 years 7 months ago
2006
IEEE
An additive spanner of an unweighted undirected graph G with distortion d is a subgraph H such that for any two vertices u, v ∈ G, we have δH(u, v) ≤ δG(u, v) + d. For every...
121
click to vote
IEEEPACT
2005
IEEE
15 years 7 months ago
2005
IEEE
Global address space languages like UPC exhibit high performance and portability on a broad class of shared and distributed memory parallel architectures. The most scalable applic...
110
Voted
DIS
2006
Springer
15 years 5 months ago
2006
Springer
Abstract. Clustering algorithms based on a matrix of pairwise similarities (kernel matrix) for the data are widely known and used, a particularly popular class being spectral clust...
153
click to vote
COMPGEOM
2008
ACM
15 years 3 months ago
2008
ACM
We introduce a hierarchical partitioning scheme of the Euclidean plane, called circular partitions. Such a partition consists of a hierarchy of convex polygons, each having small ...