840 search results - page 162 / 168 » The Complexity of the Extended GCD Problem |
PLDI
1997
ACM
13 years 12 months ago
1997
ACM
A major research goal for compilers and environments is the automatic derivation of tools from formal specifications. However, the formal model of the language is often inadequat...
DAC
1994
ACM
13 years 11 months ago
1994
ACM
Current asynchronous tools are focussed mainly on the design of a single interface module. In many applications, one must design interacting interface modules that potentially comm...
FSTTCS
1992
Springer
13 years 11 months ago
1992
Springer
In this paper we study the consequences of the existence of sparse hard sets for NP and other complexity classes under certain types of deterministic, randomized, and nondetermini...
SIGMOD
1994
ACM
13 years 11 months ago
1994
ACM
Spatial joins are one of the most important operations for combining spatial objects of several relations. In this paper, spatial join processing is studied in detail for extended...
KDD
2010
ACM
13 years 11 months ago
2010
ACM
The detection of repeated subsequences, time series motifs, is a problem which has been shown to have great utility for several higher-level data mining algorithms, including clas...