Sciweavers

467 search results - page 57 / 94
» The Complexity of Polynomials and Their Coefficient Function...
Sort
View
ICCV
2005
IEEE
15 years 5 months ago
How Hard is 3-View Triangulation Really?
We present a solution for optimal triangulation in three views. The solution is guaranteed to find the optimal solution because it computes all the stationary points of the (maxi...
Henrik Stewénius, Frederik Schaffalitzky, D...
CSL
2006
Springer
15 years 3 months ago
Verification of Ptime Reducibility for System F Terms Via Dual Light Affine Logic
In a previous work we introduced Dual Light Affine Logic (DLAL) ([BT04]) as a variant of Light Linear Logic suitable for guaranteeing complexity properties on lambda-calculus terms...
Vincent Atassi, Patrick Baillot, Kazushige Terui
IJCAI
2003
15 years 1 months ago
Incremental Utility Elicitation with the Minimax Regret Decision Criterion
Utility elicitation is a critical function of any automated decision aid, allowing decisions to be tailored to the preferences of a specific user. However, the size and complexit...
Tianhan Wang, Craig Boutilier
FUIN
2006
81views more  FUIN 2006»
14 years 11 months ago
Redundant Call Elimination via Tupling
Redundant call elimination has been an important program optimisation process as it can produce super-linear speedup in optimised programs. In this paper, we investigate use of the...
Wei-Ngan Chin, Siau-Cheng Khoo, Neil Jones
FOCS
2007
IEEE
15 years 3 months ago
Discrepancy and the Power of Bottom Fan-in in Depth-three Circuits
We develop a new technique of proving lower bounds for the randomized communication complexity of boolean functions in the multiparty `Number on the Forehead' model. Our meth...
Arkadev Chattopadhyay