263 search results - page 46 / 53 » Splitting of Learnable Classes |
COMPGEOM
2009
ACM
14 years 3 months ago
2009
ACM
Color red and blue the n vertices of a convex polytope P in R3 . Can we compute the convex hull of each color class in o(n log n)? What if we have χ > 2 colors? What if the co...
CVPR
2008
IEEE
14 years 3 months ago
2008
IEEE
We propose a new method to partition an unlabeled dataset, called Discriminative Context Partitioning (DCP). It is motivated by the idea of splitting the dataset based only on how...
MODELS
2007
Springer
14 years 2 months ago
2007
Springer
Abstract. Models addressing both structure and behaviour of a system are usually quite complex. Much of the complexity is caused by the necessity to distinguish between different c...
DATE
2006
IEEE
14 years 2 months ago
2006
IEEE
Temporal partitioning techniques are useful to implement large and complex applications, which can be split into partitions in FPGA devices. In order to minimize resources, each o...
COCOON
2005
Springer
14 years 2 months ago
2005
Springer
To monitor an electric power system by placing as few phase measurement units (PMUs) as possible is closely related to the famous vertex cover problem and domination problem in gr...