Sciweavers

17329 search results - page 3041 / 3466
» Improved non-approximability results
Sort
View
ISPA
2005
Springer
16 years 13 days ago
Near Optimal Routing in a Small-World Network with Augmented Local Awareness
In order to investigate the routing aspects of small-world networks, Kleinberg [13] proposes a network model based on a d-dimensional lattice with long-range links chosen at random...
Jianyang Zeng, Wen-Jing Hsu, Jiangdian Wang
BMCBI
2005
113views more  BMCBI 2005»
15 years 6 months ago
Microarray scanner calibration curves: characteristics and implications
Background: Microarray-based measurement of mRNA abundance assumes a linear relationship between the fluorescence intensity and the dye concentration. In reality, however, the cal...
Leming M. Shi, Weida Tong, Zhenqiang Su, Tao Han, ...
TRECVID
2007
15 years 8 months ago
PicSOM Experiments in TRECVID 2007
Our experiments in TRECVID 2007 include participation in the high-level feature extraction, search, and video summarization tasks, using a common system framework based on multipl...
Markus Koskela, Mats Sjöberg, Ville Viitaniem...
BMCBI
2010
99views more  BMCBI 2010»
15 years 7 months ago
A statistical method for excluding non-variable CpG sites in high-throughput DNA methylation profiling
Background: High-throughput DNA methylation arrays are likely to accelerate the pace of methylation biomarker discovery for a wide variety of diseases. A potential problem with a ...
Hailong Meng, Andrew R. Joyce, Daniel E. Adkins, P...
ICCV
2009
IEEE
16 years 12 months ago
Efficient subset selection based on the Renyi entropy
Many machine learning algorithms require the summation of Gaussian kernel functions, an expensive operation if implemented straightforwardly. Several methods have been proposed t...
Vlad I. Morariu1, Balaji V. Srinivasan, Vikas C. R...
« Prev « First page 3041 / 3466 Last » Next »