131 search results - page 23 / 27 » Hypergraphs with independent neighborhoods |
DICTA
2007
13 years 9 months ago
2007
We propose a kernel-density based scheme that incorporates the object colors with their spatial relevance to track the object in a video sequence. The object is modeled by the col...
NIPS
2004
13 years 9 months ago
2004
The standard approach to the classification of objects is to consider the examples as independent and identically distributed (iid). In many real world settings, however, this ass...
DAM
2008
13 years 7 months ago
2008
Let G = (V, E) be a graph with vertex set V and edge set E. The k-coloring problem is to assign a color (a number chosen in {1, . . . , k}) to each vertex of G so that no edge has...
JCP
2008
13 years 7 months ago
2008
The Self Organizing Map (SOM) involves neural networks, that learns the features of input data thorough unsupervised, competitive neighborhood learning. In the SOM learning algorit...
CP
2010
Springer
13 years 6 months ago
2010
Springer
This paper studies the use of decomposition techniques to quickly find high-quality solutions to large-scale vehicle routing problems with time windows. It considers an adaptive d...