Sciweavers

8647 search results - page 547 / 1730
» The Container Selection Problem
Sort
View
JCT
2010
127views more  JCT 2010»
15 years 1 months ago
On the density of a graph and its blowup
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 ...
Asaf Shapira, Raphael Yuster
ICCV
2001
IEEE
16 years 9 months ago
Pairwise Face Recognition
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...
Guodong Guo, HongJiang Zhang, Stan Z. Li
VLDB
2000
ACM
166views Database» more  VLDB 2000»
15 years 10 months ago
What Is the Nearest Neighbor in High Dimensional Spaces?
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. ...
TCBB
2008
113views more  TCBB 2008»
15 years 7 months ago
Efficient Algorithms for the Computational Design of Optimal Tiling Arrays
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...
Alexander Schliep, Roland Krause
JSW
2007
123views more  JSW 2007»
15 years 7 months ago
A Taxonomy for a Constructive Approach to Software Evolution
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...
Selim Ciraci, Pim van den Broek, Mehmet Aksit