Sciweavers

1092 search results - page 178 / 219
» Polynomial Interpretations and the Complexity of Algorithms
Sort
View
WINE
2009
Springer
178views Economy» more  WINE 2009»
15 years 8 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
BIRTHDAY
2010
Springer
15 years 3 months ago
Choiceless Computation and Symmetry
Many natural problems in computer science concern structures like graphs where elements are not inherently ordered. In contrast, Turing machines and other common models of computa...
Benjamin Rossman
AI
2010
Springer
15 years 2 months ago
Understanding the scalability of Bayesian network inference using clique tree growth curves
Bayesian networks (BNs) are used to represent and ef ciently compute with multi-variate probability distributions in a wide range of disciplines. One of the main approaches to per...
Ole J. Mengshoel
ICCV
2009
IEEE
16 years 6 months ago
Moving in Stereo: Efficient Structure and Motion Using Lines
We present a fast and robust system for estimating structure and motion using a stereo pair, with straight lines as features. Our first set of contributions are efficient algorit...
Manmohan Chandraker, Jongwoo Lim, David Kriegman
CVPR
2004
IEEE
16 years 3 months ago
Globally Optimal Segmentation of Interacting Surfaces with Geometric Constraints
Abstract-- Efficient detection of globally optimal surfaces representing object boundaries in volumetric datasets is important and remains challenging in many medical image analysi...
Kang Li, Xiaodong Wu, Danny Z. Chen, Milan Sonka