Sciweavers

113 search results - page 11 / 23
» Optimal Hardness Results for Maximizing Agreements with Mono...
Sort
View
ECCV
2006
Springer
14 years 9 months ago
Example Based Non-rigid Shape Detection
Since it is hard to handcraft the prior knowledge in a shape detection framework, machine learning methods are preferred to exploit the expert annotation of the target shape in a d...
Yefeng Zheng, Xiang Sean Zhou, Bogdan Georgescu, S...
ATAL
2010
Springer
13 years 8 months ago
Optimal temporal decoupling in multiagent systems
When agents need to interact in order to solve some (possibly common) problem, resolving potential conflicts beforehand is often preferred to coordination during execution. Agents...
Léon Planken, Mathijs de Weerdt, Cees Witte...
UAI
1998
13 years 8 months ago
The Bayesian Structural EM Algorithm
In recent years there has been a flurry of works on learning Bayesian networks from data. One of the hard problems in this area is how to effectively learn the structure of a beli...
Nir Friedman
MOBIHOC
2005
ACM
14 years 7 months ago
Power balanced coverage-time optimization for clustered wireless sensor networks
We consider a wireless sensor network in which sensors are grouped into clusters, each with its own cluster head (CH). Each CH collects data from sensors in its cluster and relays...
Tao Shu, Marwan Krunz, Sarma B. K. Vrudhula
CORR
2010
Springer
248views Education» more  CORR 2010»
13 years 7 months ago
Optimal Spectrum Sharing in MIMO Cognitive Radio Networks via Semidefinite Programming
Abstract--In cognitive radio (CR) networks with multipleinput multiple-output (MIMO) links, secondary users (SUs) can exploit "spectrum holes" in the space domain to acce...
Ying Jun Zhang, Anthony Man-Cho So