2333 search results - page 382 / 467 » Recursive Computational Depth |
165
click to vote
SLIP
2003
ACM
16 years 17 days ago
2003
ACM
The problem of interconnect architecture arises when an array of processors needs to be integrated on one chip. With the deep sub-micron technology, devices become cheap while wir...
217
click to vote
BIRTHDAY
2003
Springer
16 years 16 days ago
2003
Springer
Chomsky’s theory of syntax came after criticism of probabilistic associative models of word order in sentences. Immediate constituent structures are plausible but their descripti...
187
Voted
ICALP
2003
Springer
16 years 15 days ago
2003
Springer
Suppose we have n algorithms, quantum or classical, each computing some bit-value with bounded error probability. We describe a quantum algorithm that uses O( √ n) repetitions of...
187
click to vote
FOCS
2002
IEEE
16 years 8 days ago
2002
IEEE
We obtain a near-tight bound of O(n3+ε ), for any ε > 0, on the complexity of the overlay of the minimization diagrams of two collections of surfaces in four dimensions. This...
197
Voted
GLVLSI
2002
IEEE
16 years 8 days ago
2002
IEEE
Many computation-intensive or recursive applications commonly found in digital signal processing and image processing applications can be represented by data-flow graphs (DFGs). ...