44651 search results - page 239 / 8931 » Generalized |
191
click to vote
GD
1997
Springer
15 years 10 months ago
1997
Springer
Although routing is a well-studied problem in various contexts, there remain unsolved problems in routing edges for graph layouts. In contrast with techniques from other domains su...
155
click to vote
PEPM
1993
ACM
15 years 10 months ago
1993
ACM
Applications of partial evaluation have so far mainly focused on generation of compilers from interpreters for programming languages. We partially evaluate a simple general LR(k) ...
169
click to vote
SIGGRAPH
1989
ACM
15 years 10 months ago
1989
ACM
We analyse some recent approaches to the global illumination problem by introducing the corresponding reflection operators, and we demonstrate the advantages of a two-pass method....
153
click to vote
STACS
1989
Springer
15 years 10 months ago
1989
Springer
A sequence is said to be k-automatic if the nth term of this sequence is generated by a finite state machine with n in base k as input. Regular sequences were first defined by ...
151
click to vote
ICC
2007
IEEE
15 years 10 months ago
2007
IEEE
The construction of good, finite-length, LDPC codes is currently an attractive research area. Reducing attention to the Binary Erasure Channel (BEC), this problem translates into t...