1960 search results - page 134 / 392 » The Logic of Large Enough |
ADHOC
2006
13 years 9 months ago
2006
Routing in ad-hoc networks is a complicated task because of many reasons. The nodes are low-memory, lowpowered, and they cannot maintain routing tables large enough for well-known ...
CVIU
2006
13 years 9 months ago
2006
This paper describes how a visual system can automatically define features of interest from the observation of a large enough number of natural images. The principle complements t...
COMBINATORICA
2007
13 years 9 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...
IVC
2008
13 years 9 months ago
2008
This research describes a novel approach that accurately detects depth edges with cluttered inner texture edges effectively ignored. We strategically project structured light and ...
AML
2005
13 years 9 months ago
2005
Under certain cardinal arithmetic assumptions, we prove that for every large enough regular cardinal, for many regular < , many stationary subsets of concentrating on cofinali...