870 search results - page 36 / 174 » Constructions for Difference Triangle Sets |
WSCG
2003
13 years 10 months ago
2003
Real-time rendering of vegetation is one of the most important challenges in outdoor scenes. This is due to the vast amount of polygons that are used to model vegetable species. M...
SODA
1998
ACM
13 years 10 months ago
1998
ACM
Given an undirected graph with nonnegative costs on the edges, the routing cost of any of its spanning trees is the sum over all pairs of vertices of the cost of the path between t...
VISUALIZATION
1996
IEEE
14 years 28 days ago
1996
IEEE
This can be a costly operation. When the data is arranged according to its three-dimensional coordinates, calculating the contour surfaces requires examining each data cell. Avoidi...
AAAI
2008
13 years 11 months ago
2008
Classification is one of the most fundamental problems in machine learning, which aims to separate the data from different classes as far away as possible. A common way to get a g...
COMBINATORICS
2002
13 years 8 months ago
2002
Let G = (V, E) be a connected undirected graph and S a subset of vertices. If for all vertices v V , the sets Br(v) S are all nonempty and different, where Br(v) denotes the set...