Sciweavers

1968 search results - page 372 / 394
» The Complexity of Valued Constraint Models
Sort
View
DATE
2010
IEEE
195views Hardware» more  DATE 2010»
13 years 10 months ago
Cool MPSoC programming
Abstract--This paper summarizes a special session on multicore/multi-processor system-on-chip (MPSoC) programming challenges. Wireless multimedia terminals are among the key driver...
Rainer Leupers, Lothar Thiele, Xiaoning Nie, Bart ...
SIGCOMM
2010
ACM
13 years 8 months ago
Cloudward bound: planning for beneficial migration of enterprise applications to the cloud
In this paper, we tackle challenges in migrating enterprise services into hybrid cloud-based deployments, where enterprise operations are partly hosted on-premise and partly in th...
Mohammad Y. Hajjat, Xin Sun, Yu-Wei Eric Sung, Dav...
BMCBI
2002
108views more  BMCBI 2002»
13 years 8 months ago
A memory-efficient dynamic programming algorithm for optimal alignment of a sequence to an RNA secondary structure
Background: Covariance models (CMs) are probabilistic models of RNA secondary structure, analogous to profile hidden Markov models of linear sequence. The dynamic programming algo...
Sean R. Eddy
INFOCOM
2011
IEEE
12 years 11 months ago
Pricing-based spectrum access control in cognitive radio networks with random access
Abstract—Market-based mechanisms offer promising approaches for spectrum access in cognitive radio networks. In this paper, we focus on two market models, one with a monopoly pri...
Lei Yang, Hongseok Kim, Junshan Zhang, Mung Chiang...
PODS
2009
ACM
119views Database» more  PODS 2009»
14 years 9 months ago
Dynamic indexability and lower bounds for dynamic one-dimensional range query indexes
The B-tree is a fundamental external index structure that is widely used for answering one-dimensional range reporting queries. Given a set of N keys, a range query can be answere...
Ke Yi