Sciweavers

4679 search results - page 9 / 936
» Modeling When Connections Are the Problem
Sort
View
CVPR
2000
IEEE
15 years 11 months ago
Order Parameters for Minimax Entropy Distributions: When Does High Level Knowledge Help?
Many problems in vision can be formulated as Bayesian inference. It is important to determine the accuracy of these inferences and how they depend on the problem domain. In recent...
Alan L. Yuille, James M. Coughlan, Song Chun Zhu, ...
INFOCOM
2006
IEEE
15 years 3 months ago
The Complexity of Connectivity in Wireless Networks
— We define and study the scheduling complexity in wireless networks, which expresses the theoretically achievable efficiency of MAC layer protocols. Given a set of communicati...
Thomas Moscibroda, Roger Wattenhofer
PERCOM
2011
ACM
14 years 1 months ago
Mobile node rostering in intermittently connected passive RFID networks
— This paper focuses on the problem of rostering in intermittently connected passive RFID networks. It aims to report a list of tagged mobile nodes that appear in given intereste...
Zhipeng Yang, Hongyi Wu
IJCAI
2003
14 years 11 months ago
When Discriminative Learning of Bayesian Network Parameters Is Easy
Bayesian network models are widely used for discriminative prediction tasks such as classification. Usually their parameters are determined using 'unsupervised' methods ...
Hannes Wettig, Peter Grünwald, Teemu Roos, Pe...
JAL
2002
71views more  JAL 2002»
14 years 9 months ago
A primal-dual schema based approximation algorithm for the element connectivity problem
The element connectivity problem falls in the category of survivable network design problems { it is intermediate to the versions that ask for edge-disjoint and vertex-disjoint pa...
Kamal Jain, Ion I. Mandoiu, Vijay V. Vazirani, Dav...