Sciweavers

1020 search results - page 204 / 204
» Efficiency of Search Methods in Dynamic Wireless Networks
Sort
View
CCO
2001
Springer
161views Combinatorics» more  CCO 2001»
13 years 11 months ago
Branch, Cut, and Price: Sequential and Parallel
Branch, cut, and price (BCP) is an LP-based branch and bound technique for solving large-scale discrete optimization problems (DOPs). In BCP, both cuts and variables can be generat...
Laszlo Ladányi, Ted K. Ralphs, Leslie E. Tr...
HT
2010
ACM
13 years 8 months ago
Capturing implicit user influence in online social sharing
Online social sharing sites are becoming very popular nowadays among Web users, who use these sites to share their favourite items and to discover interesting and useful items fro...
Ching-man Au Yeung, Tomoharu Iwata
BMCBI
2010
106views more  BMCBI 2010»
13 years 7 months ago
A computational evaluation of over-representation of regulatory motifs in the promoter regions of differentially expressed genes
Background: Observed co-expression of a group of genes is frequently attributed to co-regulation by shared transcription factors. This assumption has led to the hypothesis that pr...
Guofeng Meng, Axel Mosig, Martin Vingron
BMCBI
2006
122views more  BMCBI 2006»
13 years 7 months ago
A multivariate prediction model for microarray cross-hybridization
Background: Expression microarray analysis is one of the most popular molecular diagnostic techniques in the post-genomic era. However, this technique faces the fundamental proble...
Yian A. Chen, Cheng-Chung Chou, Xinghua Lu, Elizab...
VLDB
2008
ACM
147views Database» more  VLDB 2008»
14 years 7 months ago
Tree-based partition querying: a methodology for computing medoids in large spatial datasets
Besides traditional domains (e.g., resource allocation, data mining applications), algorithms for medoid computation and related problems will play an important role in numerous e...
Kyriakos Mouratidis, Dimitris Papadias, Spiros Pap...