1922 search results - page 73 / 385 » ie 2007 |
COMBINATORICA
2007
13 years 8 months ago
2007
We derive a sufficient condition for a sparse graph G on n vertices to contain a copy of a tree T of maximum degree at most d on (1 − )n vertices, in terms of the expansion prop...
COMSIS
2007
13 years 8 months ago
2007
The theoretical outcomes and experimental results of new color model implemented in algorithms and software of image processing are presented in the paper. This model, as it will b...
EJC
2007
13 years 8 months ago
2007
Let K− r denote the graph obtained from Kr by deleting one edge. We show that for every integer r ≥ 4 there exists an integer n0 = n0(r) such that every graph G whose order n â...
MMS
2006
13 years 8 months ago
2006
Abstract In this paper we describe a form of communication that could be used for lifelong learning as contribution to cultural computing. We call it Kansei Mediation. It is a mult...
AHSWN
2005
13 years 8 months ago
2005
Topology control has been well studied in wireless ad hoc networks. However, only a few topology control methods take into account the low interference as a goal of the methods. So...