Sciweavers

3433 search results - page 520 / 687
» Heuristics for a bidding problem
Sort
View
TCBB
2008
103views more  TCBB 2008»
15 years 6 months ago
DNA Motif Representation with Nucleotide Dependency
The problem of discovering novel motifs of binding sites is important to the understanding of gene regulatory networks. Motifs are generally represented by matrices (PWM or PSSM) o...
Francis Y. L. Chin, Henry C. M. Leung
TDP
2008
160views more  TDP 2008»
15 years 6 months ago
Enhanced P-Sensitive K-Anonymity Models for Privacy Preserving Data Publishing
Publishing data for analysis from a micro data table containing sensitive attributes, while maintaining individual privacy, is a problem of increasing significance today. The k-ano...
Xiaoxun Sun, Hua Wang, Jiuyong Li, Traian Marius T...
TON
2008
125views more  TON 2008»
15 years 6 months ago
Two techniques for fast computation of constrained shortest paths
Abstract-- Computing constrained shortest paths is fundamental to some important network functions such as QoS routing, which is to find the cheapest path that satisfies certain co...
Shigang Chen, Meongchul Song, Sartaj Sahni
TPDS
2008
126views more  TPDS 2008»
15 years 6 months ago
Efficient Directional Network Backbone Construction in Mobile Ad Hoc Networks
In this paper, we consider the issue of constructing an energy-efficient virtual network backbone in mobile ad hoc networks (MANETs) for broadcasting applications using directiona...
Shuhui Yang, Jie Wu, Fei Dai
TWC
2008
121views more  TWC 2008»
15 years 6 months ago
Optimal Downlink OFDMA Resource Allocation with Linear Complexity to Maximize Ergodic Rates
OFDMA resource allocation assigns subcarriers and power, and possibly data rates, to each user. Previous research efforts to optimize OFDMA resource allocation with respect to comm...
Ian C. Wong, Brian L. Evans