It is well-known that, of all graphs with edge-density p, the random graph G(n, p) contains the smallest density of copies of Kt,t, the complete bipartite graph of size 2t. Since ...
We develop a pairwise classification framework for face recognition, in which a class face recognition problem is divided into a set of ? ?? ? two class problems. Such a problem...
Nearest neighbor search in high dimensional spaces is an interesting and important problem which is relevant for a wide variety of novel database applications. As recent results s...
Alexander Hinneburg, Charu C. Aggarwal, Daniel A. ...
The representation of a genome by oligonucleotide probes is a prerequisite for the analysis of many of its basic properties, such as transcription factor binding sites, chromosomal...
Abstract— In many software design and evaluation techniques, either the software evolution problem is not systematically elaborated, or only the impact of evolution is considered...