Sciweavers

2194 search results - page 249 / 439
» Improving HLRTA*( k )
Sort
View
COCO
2003
Springer
162views Algorithms» more  COCO 2003»
15 years 6 months ago
Near-Optimal Lower Bounds on the Multi-Party Communication Complexity of Set Disjointness
We study the communication complexity of the set disjointness problem in the general multi-party model. For t players, each holding a subset of a universe of size n, we establish ...
Amit Chakrabarti, Subhash Khot, Xiaodong Sun
BMCBI
2006
134views more  BMCBI 2006»
15 years 1 months ago
Application of machine learning in SNP discovery
Background: Single nucleotide polymorphisms (SNP) constitute more than 90% of the genetic variation, and hence can account for most trait differences among individuals in a given ...
Lakshmi K. Matukumalli, John J. Grefenstette, Davi...
MOBIHOC
2004
ACM
16 years 28 days ago
Localized algorithms for energy efficient topology in wireless ad hoc networks
We propose several novel localized algorithms to construct energy efficient routing structures for homogeneous wireless ad hoc networks, where all nodes have same maximum transmis...
Wen-Zhan Song, Yu Wang 0003, Xiang-Yang Li
BMCBI
2010
99views more  BMCBI 2010»
15 years 1 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...
STOC
2007
ACM
100views Algorithms» more  STOC 2007»
16 years 1 months ago
Reordering buffers for general metric spaces
In the reordering buffer problem, we are given an input sequence of requests for service each of which corresponds to a point in a metric space. The cost of serving the requests h...
Matthias Englert, Harald Räcke, Matthias West...