70 search results - page 4 / 14 » Improved Pseudorandom Generators for Depth 2 Circuits |
100
click to vote
FOCS
1999
IEEE
15 years 1 months ago
1999
IEEE
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...
TCS
1998
14 years 9 months ago
1998
![Threshold Dominating Sets and an Improved Characterization of W[2]](https://www.sciweavers.org/files/imagecache/thumbnail/imagecache/threshold_dominating_sets_and_an_improved_characterization_of_w_2_TCS_1998.jpg "Threshold Dominating Sets and an Improved Characterization of W[2]")
The Threshold Dominating Set problem is that of determining for a graph G = (V, E) whether there is a subset V ⊆ V of size k, such that for each vertex v ∈ V there are at leas...
126
Voted
FGR
1996
IEEE
15 years 1 months ago
1996
IEEE
This paper presents a global scheme for 3D face reconstruction and face segmentation into a limited number of analytical patches from stereo images. From a depth map, we generate ...
70
Voted
DATE
2009
IEEE
15 years 4 months ago
2009
IEEE
— Non-Linear Feedback Shift Registers (NLFSRs) have been proposed as an alternative to Linear Feedback Shift Registers (LFSRs) for generating pseudo-random sequences for stream c...
FPL
2003
Springer
15 years 2 months ago
2003
Springer
Abstract. Data dependent circuits are logic circuits specialized to specific input data. They are smaller and faster than the original circuits, although they are not reusable and...