Sciweavers

2192 search results - page 110 / 439
» Algorithms for Challenging Motif Problems
Sort
View
CORR
2010
Springer
146views Education» more  CORR 2010»
13 years 8 months ago
Adaptive Submodularity: A New Approach to Active Learning and Stochastic Optimization
Solving stochastic optimization problems under partial observability, where one needs to adaptively make decisions with uncertain outcomes, is a fundamental but notoriously diffic...
Daniel Golovin, Andreas Krause
COMGEO
2010
ACM
13 years 5 months ago
Implementing a Bayesian approach to criminal geographic profiling
The geographic profiling problem is to create an operationally useful estimate of the location of the home base of a serial criminal from the known locations of the offense sites....
Mike O'Leary
ICUIMC
2011
ACM
12 years 11 months ago
A cross-layer design for resource allocation and congestion control in multichannel multi-hop cognitive radio networks
Efficient and fair resource allocation associated with congestion control in multi-hop cognitive radio networks (CRN) is a challenging problem. In this paper, we consider their mu...
Nguyen Van Mui, Choong Seon Hong
TMC
2010
196views more  TMC 2010»
13 years 6 months ago
Joint Routing, Channel Assignment, and Scheduling for Throughput Maximization in General Interference Models
—Throughput optimization in wireless networks with multiple channels and multiple radio interfaces per node is a challenging problem. For general traffic models (given a set of ...
Mahmoud Al-Ayyoub, Himanshu Gupta
RECOMB
2008
Springer
14 years 8 months ago
Fast and Accurate Alignment of Multiple Protein Networks
Comparative analysis of protein networks has proven to be a powerful approach for elucidating network structure and predicting protein function and interaction. A fundamental chall...
Maxim Kalaev, Vineet Bafna, Roded Sharan