Sciweavers

11214 search results - page 2045 / 2243
» Just-in-time data structures
Sort
View
CCCG
1993
15 years 1 months ago
Widest-corridor Problems
A k-dense corridor through a finite set, S, of n points in the plane is the open region of the plane that is bounded by two parallel lines that intersect the convex hull of S and ...
Ravi Janardan, Franco P. Preparata
COLING
1996
15 years 1 months ago
Bilingual Knowledge Acquisition from Korean-English Parallel Corpus Using Alignment
This paper snggests a method to align Korean-English parallel corpus. '1?he structural dissimilarity between Korean and Indo-European languages requires more flexible measure...
Jung H. Shin, Young S. Han, Key-Sun Choi
IJCAI
1993
15 years 1 months ago
On the Polynomial Transparency of Resolution
In this paper a framework is developed for measuring the complexities of deductions in an ab­ stract and computationally perspicuous man­ ner. As a notion of central importance ...
Reinhold Letz
IFIPPACT
1994
15 years 1 months ago
Exploiting the Parallelism Exposed by Partial Evaluation
: We describe an approach to parallel compilation that seeks to harness the vast amount of ne-grain parallelism that is exposed through partial evaluation of numerically-intensive ...
Rajeev J. Surati, Andrew A. Berlin
LFP
1994
129views more  LFP 1994»
15 years 1 months ago
Static Dependent Costs for Estimating Execution Time
We present the rst system for estimating and using datadependent expression execution times in a language with rst-class procedures and imperative constructs. The presence of rst-...
Brian Reistad, David K. Gifford
« Prev « First page 2045 / 2243 Last » Next »