Sciweavers

1722 search results - page 29 / 345
» On the sample mean of graphs
Sort
View
MIR
2004
ACM
171views Multimedia» more  MIR 2004»
15 years 3 months ago
Mean version space: a new active learning method for content-based image retrieval
In content-based image retrieval, relevance feedback has been introduced to narrow the gap between low-level image feature and high-level semantic concept. Furthermore, to speed u...
Jingrui He, Hanghang Tong, Mingjing Li, HongJiang ...
DM
2008
62views more  DM 2008»
14 years 10 months ago
Classification of some strongly regular subgraphs of the McLaughlin graph
By means of an exhaustive computer search we have proved that the strongly regular graphs with parameters (v, k, ,
Jan Degraer, Kris Coolsaet
TSP
2008
97views more  TSP 2008»
14 years 10 months ago
Risk-Sensitive Particle Filters for Mitigating Sample Impoverishment
Risk-sensitive filters (RSF) put a penalty to higher-order moments of the estimation error compared to conventional filters as the Kalman filter minimizing the mean square error. ...
Umut Orguner, Fredrik Gustafsson
COMBINATORICS
2000
138views more  COMBINATORICS 2000»
14 years 9 months ago
Quasi-Spectral Characterization of Strongly Distance-Regular Graphs
A graph with diameter d is strongly distance-regular if is distanceregular and its distance-d graph d is strongly regular. The known examples are all the connected strongly regu...
Miguel Angel Fiol
BMCBI
2007
102views more  BMCBI 2007»
14 years 10 months ago
Understanding and using the meaning of statements in a bio-ontology: recasting the Gene Ontology in OWL
The bio-ontology community falls into two camps: first we have biology domain experts, who actually hold the knowledge we wish to capture in ontologies; second, we have ontology s...
Mikel Egaña Aranguren, Sean Bechhofer, Phil...