Sciweavers

2686 search results - page 281 / 538
» Testing metric properties
Sort
View
SODA
2004
ACM
121views Algorithms» more  SODA 2004»
15 years 8 months ago
A characterization of easily testable induced subgraphs
Let H be a fixed graph on h vertices. We say that a graph G is induced H-free if it does not contain any induced copy of H. Let G be a graph on n vertices and suppose that at leas...
Noga Alon, Asaf Shapira
BMCBI
2007
105views more  BMCBI 2007»
15 years 6 months ago
VaxiJen: a server for prediction of protective antigens, tumour antigens and subunit vaccines
Background: Vaccine development in the post-genomic era often begins with the in silico screening of genome information, with the most probable protective antigens being predicted...
Irini A. Doytchinova, Darren R. Flower
CVPR
2006
IEEE
16 years 8 months ago
Clustering Appearance for Scene Analysis
We propose a new approach called "appearance clustering" for scene analysis. The key idea in this approach is that the scene points can be clustered according to their s...
Sanjeev J. Koppal, Srinivasa G. Narasimhan
KDD
2008
ACM
161views Data Mining» more  KDD 2008»
16 years 7 months ago
Locality sensitive hash functions based on concomitant rank order statistics
: Locality Sensitive Hash functions are invaluable tools for approximate near neighbor problems in high dimensional spaces. In this work, we are focused on LSH schemes where the si...
Kave Eshghi, Shyamsundar Rajaram
IMC
2006
ACM
16 years 16 days ago
Measurement based analysis, modeling, and synthesis of the internet delay space
Understanding the characteristics of the Internet delay space (i.e., the all-pairs set of static round-trip propagation delays among edge networks in the Internet) is important fo...
Bo Zhang, T. S. Eugene Ng, Animesh Nandi, Rudolf H...