Sciweavers

1287 search results - page 41 / 258
» Self-Normalized Linear Tests
Sort
View
ENTCS
2008
103views more  ENTCS 2008»
13 years 7 months ago
Analyzing Reachability for Some Petri Nets With Fast Growing Markings
Using linear algebraic techniques, we analyse the computational complexity of testing reachability in Petri nets for which markings can grow very fast. This leads to two subclasse...
M. Praveen, Kamal Lodaya
TRANSCI
2008
80views more  TRANSCI 2008»
13 years 7 months ago
An Efficient Method to Compute Traffic Assignment Problems with Elastic Demands
The traffic assignment problem with elastic demands can be formulated as an optimization problem, whose objective is sum of a congestion function and a disutility function. We pro...
Frédéric Babonneau, Jean-Philippe Vi...
MVA
2000
273views Computer Vision» more  MVA 2000»
13 years 7 months ago
A compact algorithm for rectification of stereo pairs
We present a linear rectification algorithm for general, unconstrained stereo rigs. The algorithm takes the two perspective projection matrices of the original cameras, and compute...
Andrea Fusiello, Emanuele Trucco, Alessandro Verri
MFCS
2001
Springer
14 years 6 days ago
On Pseudorandom Generators in NC
In this paper we consider the question of whether NC0 circuits can generate pseudorandom distributions. While we leave the general question unanswered, we show • Generators compu...
Mary Cryan, Peter Bro Miltersen
COLOGNETWENTE
2009
13 years 8 months ago
Improved Strategies for Branching on General Disjunctions
Abstract Within the context of solving Mixed-Integer Linear Programs by a Branch-andCut algorithm, we propose a new strategy for branching. Computational experiments show that, on ...
Gérard Cornuéjols, Leo Liberti, Giac...