Sciweavers

1381 search results - page 259 / 277
» Computational Complexity of Constraint Satisfaction
Sort
View
CORR
2010
Springer
170views Education» more  CORR 2010»
13 years 7 months ago
Slow Adaptive OFDMA Systems Through Chance Constrained Programming
Adaptive orthogonal frequency division multiple access (OFDMA) has recently been recognized as a promising technique for providing high spectral efficiency in future broadband wire...
William Weiliang Li, Ying Jun Zhang, Anthony Man-C...
BMCBI
2006
111views more  BMCBI 2006»
13 years 7 months ago
PepDist: A New Framework for Protein-Peptide Binding Prediction based on Learning Peptide Distance Functions
Background: Many different aspects of cellular signalling, trafficking and targeting mechanisms are mediated by interactions between proteins and peptides. Representative examples...
Tomer Hertz, Chen Yanover
CGF
2004
86views more  CGF 2004»
13 years 7 months ago
Procedural Texture Matching and Transformation
We present a technique for creating a smoothly varying sequence of procedural textures that interpolates between arbitrary input samples of texture. This texture transformation us...
Eric Bourque, Gregory Dudek
SECON
2010
IEEE
13 years 5 months ago
Utility-Based Gateway Deployment for Supporting Multi-Domain DTNs
Abstract--Due to technology or policy constraints, communications across network domains usually require the intervention of gateways, and their proper deployment is crucial to the...
Ting He, Kang-Won Lee, Nikoletta Sofra, Kin K. Leu...
TCSV
2010
13 years 2 months ago
Application-Centric Routing for Video Streaming Over MultiHop Wireless Networks
Abstract--Most existing works on routing for video transmission over multihop wireless networks only focus on how to satisfy the network-oriented quality-of-service (QoS), such as ...
Dalei Wu, Song Ci, Haohong Wang, Aggelos K. Katsag...