6568 search results - page 332 / 1314 » Reducing the Complexity of Reductions |
175
click to vote
ESOP
2000
Springer
15 years 10 months ago
2000
Springer
We introduce graph reduction technology that implements functional languages with control, such as Scheme with call/cc, where continuations can be manipulated explicitly as values,...
141
click to vote
ECIR
2007
Springer
15 years 8 months ago
2007
Springer
This paper addresses the problem of identifying collection dependent stop-words in order to reduce the size of inverted files. We present four methods to automatically recognise s...
171
click to vote
LATA
2009
Springer
15 years 11 months ago
2009
Springer
Abstract. This paper contributes to the study of Freely Rewriting Restarting Automata (FRR-automata) and Parallel Communicating Grammar Systems (PCGS) as formalizations of the ling...
176
click to vote
FOCS
1997
IEEE
15 years 11 months ago
1997
IEEE
We show that in the context of nonuniform complexity, nondeterministic logarithmic space bounded computation can be made unambiguous. An analogous result holds for the class of pr...
150
click to vote
VLSID
2007
IEEE
16 years 7 months ago
2007
IEEE
Interconnect is one of the major concerns in current and future microprocessor designs from both performance and power consumption perspective. The emergence of three-dimensional ...