1214 search results - page 22 / 243 » Labeling Points with Weights |
167
click to vote
SPAA
2009
ACM
16 years 6 months ago
2009
ACM
Informative labeling schemes consist in labeling the nodes of graphs so that queries regarding any two nodes (e.g., are the two nodes adjacent?) can be answered by inspecting mere...
141
click to vote
ORDER
2002
15 years 5 months ago
2002
In this article we describe a very efficient method to construct pairwise nonisomorphic posets (equivalently, T0 topologies). We also give the results obtained by a computer progr...
150
click to vote
ESA
2009
Springer
16 years 6 days ago
2009
Springer
We show that for every set S of n points in the plane and a designated point rt ∈ S, there exists a tree T that has small maximum degree, depth and weight. Moreover, for every po...
156
click to vote
SGP
2003
15 years 7 months ago
2003
Point sets become an increasingly popular shape representation. Most shape processing and rendering tasks require the approximation of a continuous surface from the point data. We...
206
click to vote
FOIKS
2008
Springer
16 years 2 months ago
2008
Springer
Supervised learning deals with the inference of a distribution over an output or label space $\CY$ conditioned on points in an observation space $\CX$, given a training dataset $D$...