Sciweavers

2430 search results - page 225 / 486
» Computing Tutte Polynomials
Sort
View
188
Voted
VMCAI
2005
Springer
16 years 15 days ago
On the Complexity of Error Explanation
When a system fails to satisfy its specification, the model checker produces an error trace (or counter-example) that demonstrates an undesirable behavior, which is then used in d...
Nirman Kumar, Viraj Kumar, Mahesh Viswanathan
189
Voted
FOCS
2007
IEEE
15 years 11 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
179
Voted
JSC
2010
155views more  JSC 2010»
15 years 5 months ago
Algorithms for solving linear systems over cyclotomic fields
We consider the problem of solving a linear system Ax = b over a cyclotomic field. What makes cyclotomic fields of special interest is that we can easily find a prime p that sp...
Liang Chen, Michael B. Monagan
174
Voted
CVPR
2004
IEEE
16 years 9 months ago
The Multibody Trifocal Tensor: Motion Segmentation from 3 Perspective Views
We propose a geometric approach to 3-D motion segmentation from point correspondences in three perspective views. We demonstrate that after applying a polynomial embedding to the ...
René Vidal, Richard I. Hartley
CVPR
2007
IEEE
16 years 9 months ago
Autocalibration via Rank-Constrained Estimation of the Absolute Quadric
We present an autocalibration algorithm for upgrading a projective reconstruction to a metric reconstruction by estimating the absolute dual quadric. The algorithm enforces the ra...
Manmohan Krishna Chandraker, Sameer Agarwal, Fredr...