Sciweavers

1927 search results - page 211 / 386
» UMDAs for dynamic optimization problems
Sort
View
SPAA
2004
ACM
15 years 9 months ago
Fighting against two adversaries: page migration in dynamic networks
Page migration is one of the fundamental subproblems in the framework of data management in networks. It occurs in a distributed network of processors sharing one indivisible memo...
Marcin Bienkowski, Miroslaw Korzeniowski, Friedhel...
MM
2010
ACM
137views Multimedia» more  MM 2010»
15 years 4 months ago
Unsupervised summarization of rushes videos
This paper proposes a new framework to formulate the problem of rushes video summarization as an unsupervised learning problem. We pose the problem of video summarization as one o...
Yang Liu, Feng Zhou, Wei Liu, Fernando De la Torre...
CORR
2008
Springer
132views Education» more  CORR 2008»
15 years 3 months ago
Dynamic Rate Allocation in Fading Multiple-access Channels
We consider the problem of rate allocation in a fading Gaussian multiple-access channel (MAC) with fixed transmission powers. Our goal is to maximize a general concave utility func...
Ali ParandehGheibi, Atilla Eryilmaz, Asuman E. Ozd...
JSAC
2008
202views more  JSAC 2008»
15 years 3 months ago
Cognitive Wireless Mesh Networks with Dynamic Spectrum Access
Wireless Mesh Networks (WMNs) are envisaged to extend Internet access and other networking services in personal, local, campus, and metropolitan areas. Mesh routers (MR) form the c...
Kaushik R. Chowdhury, Ian F. Akyildiz
UAI
2004
15 years 5 months ago
PAC-learning Bounded Tree-width Graphical Models
We show that the class of strongly connected graphical models with treewidth at most k can be properly efficiently PAC-learnt with respect to the Kullback-Leibler Divergence. Prev...
Mukund Narasimhan, Jeff A. Bilmes