Sciweavers

5105 search results - page 377 / 1021
» An algorithm to determine peer-reviewers
Sort
View
ESA
1999
Springer
110views Algorithms» more  ESA 1999»
15 years 11 months ago
Geometric Searching over the Rationals
We revisit classical geometric search problems under the assumption of rational coordinates. Our main result is a tight bound for point separation, ie, to determine whether n given...
Bernard Chazelle
KDD
1999
ACM
117views Data Mining» more  KDD 1999»
15 years 11 months ago
Identifying Distinctive Subsequences in Multivariate Time Series by Clustering
Most time series comparison algorithms attempt to discover what the members of a set of time series have in common. We investigate a di erent problem, determining what distinguish...
Tim Oates
ICDE
1998
IEEE
99views Database» more  ICDE 1998»
15 years 11 months ago
Query Folding with Inclusion Dependencies
Query folding is a technique for determining how a query may be answered using a given set of resources, which may include materialized views, cached results of previous queries, ...
Jarek Gryz
ANTS
1998
Springer
139views Algorithms» more  ANTS 1998»
15 years 11 months ago
Generating Arithmetically Equivalent Number Fields with Elliptic Curves
In this note we address the question whether for a given prime number p, the zeta-function of a number field always determines the p-part of its class number. The answer is known t...
Bart de Smit
179
Voted
DAC
1997
ACM
15 years 11 months ago
Data Memory Minimisation for Synchronous Data Flow Graphs Emulated on DSP-FPGA Targets
The paper presents an algorithm to determine the close-tosmallest possible data buffer sizes for arbitrary synchronous data flow (SDF) applications, such that we can guarantee the...
Marleen Adé, Rudy Lauwereins, J. A. Peperst...