197 search results - page 20 / 40 » Some Topological Methods in Graph Coloring Theory |
INFOCOM
2005
IEEE
14 years 2 months ago
2005
IEEE
— We present Gradient Landmark-Based Distributed Routing (GLIDER), a novel naming/addressing scheme and associated routing algorithm, for a network of wireless communicating node...
ICIP
2003
IEEE
14 years 10 months ago
2003
IEEE
In this paper a new automatic approach to road extraction from aerial images is proposed. This method improves a recently introduced promising approach to probabilistic contour tr...
NIPS
2004
13 years 9 months ago
2004
Co-training is a method for combining labeled and unlabeled data when examples can be thought of as containing two distinct sets of features. It has had a number of practical succ...
ALENEX
2009
13 years 9 months ago
2009
Minimal perfect hash functions have been shown to be useful to compress data in several data management tasks. In particular, order-preserving minimal perfect hash functions [10] ...
ICDE
2006
IEEE
14 years 9 months ago
2006
IEEE
Most previously proposed frequent graph mining algorithms are intended to find the complete set of all frequent, closed subgraphs. However, in many cases only a subset of the freq...