Sciweavers

14699 search results - page 2732 / 2940
» Complexity and Cognitive Computing
Sort
View
FOCS
1999
IEEE
14 years 18 days ago
Near-Optimal Conversion of Hardness into Pseudo-Randomness
Various efforts ([?, ?, ?]) have been made in recent years to derandomize probabilistic algorithms using the complexity theoretic assumption that there exists a problem in E = dti...
Russell Impagliazzo, Ronen Shaltiel, Avi Wigderson
ICCV
1999
IEEE
14 years 18 days ago
Epipolar Geometry Estimation by Tensor Voting in 8D
We present a novel, efficient, initializationfree approach to the problem of epipolar geometry estimation, by formulating it as one of hyperplane inference from a sparse and noisy...
Chi-Keung Tang, Gérard G. Medioni, Mi-Suen ...
ICDCS
1999
IEEE
14 years 18 days ago
Search Space Reduction in QoS Routing
To provide real-time service or engineer constrained-based paths, networks require the underlying routing algorithm to be able to find low-cost paths that satisfy given Quality-of...
Liang Guo, Ibrahim Matta
RT
1999
Springer
14 years 17 days ago
Lighting Design: A Goal Based Approach using Optimisation
There is a need for reliable lighting design applications because available tools are limited and inappropriate for interactive or creative use. Architects and lighting designers ...
António Cardoso Costa, António Augus...
IEEEPACT
1998
IEEE
14 years 17 days ago
Static Methods in Hybrid Branch Prediction
Hybrid branch predictors combine the predictions of multiple single-level or two-level branch predictors. The prediction-combining hardware -- the "meta-predictor" -may ...
Dirk Grunwald, Donald C. Lindsay, Benjamin G. Zorn
« Prev « First page 2732 / 2940 Last » Next »