Sciweavers

530 search results - page 106 / 106
» An Algorithm for Approximating the Satisfiability Problem of...
Sort
View
SIAMIS
2010
378views more  SIAMIS 2010»
13 years 10 hour ago
Global Interactions in Random Field Models: A Potential Function Ensuring Connectedness
Markov random field (MRF) models, including conditional random field models, are popular in computer vision. However, in order to be computationally tractable, they are limited to ...
Sebastian Nowozin, Christoph H. Lampert
TMC
2010
138views more  TMC 2010»
13 years 3 months ago
Reliable Anchor-Based Sensor Localization in Irregular Areas
—Localization is a fundamental problem in wireless sensor networks and its accuracy impacts the efficiency of location-aware protocols and applications, such as routing and stora...
Bin Xiao, Lin Chen, Qingjun Xiao, Minglu Li
WINE
2009
Springer
178views Economy» more  WINE 2009»
13 years 12 months ago
Computing Optimal Contracts in Series-Parallel Heterogeneous Combinatorial Agencies
We study an economic setting in which a principal motivates a team of strategic agents to exert costly effort toward the success of a joint project. The action taken by each agent...
Yuval Emek, Michal Feldman
ML
1998
ACM
131views Machine Learning» more  ML 1998»
13 years 4 months ago
Learning from Examples and Membership Queries with Structured Determinations
It is well known that prior knowledge or bias can speed up learning, at least in theory. It has proved di cult to make constructive use of prior knowledge, so that approximately c...
Prasad Tadepalli, Stuart J. Russell
MA
2010
Springer
94views Communications» more  MA 2010»
13 years 3 months ago
On sparse estimation for semiparametric linear transformation models
: Semiparametric linear transformation models have received much attention due to its high flexibility in modeling survival data. A useful estimating equation procedure was recent...
Hao Helen Zhang, Wenbin Lu, Hansheng Wang