Sciweavers

1347 search results - page 42 / 270
» On the Structure of the Minimum Time Function
Sort
View
CLUSTER
2006
IEEE
13 years 7 months ago
Optimizing MPI collective communication by orthogonal structures
Many parallel applications from scientific computing use MPI collective communication operations to collect or distribute data. Since the execution times of these communication op...
Matthias Kühnemann, Thomas Rauber, Gudula R&u...
STOC
2004
ACM
153views Algorithms» more  STOC 2004»
14 years 8 months ago
Quantum and classical query complexities of local search are polynomially related
Let f be an integer valued function on a finite set V . We call an undirected graph G(V, E) a neighborhood structure for f. The problem of finding a local minimum for f can be phr...
Miklos Santha, Mario Szegedy
NIPS
1998
13 years 9 months ago
Coding Time-Varying Signals Using Sparse, Shift-Invariant Representations
A common way to represent a time series is to divide it into shortduration blocks, each of which is then represented by a set of basis functions. A limitation of this approach, ho...
Michael S. Lewicki, Terrence J. Sejnowski
ICDE
2009
IEEE
148views Database» more  ICDE 2009»
14 years 9 months ago
Online Interval Skyline Queries on Time Series
In many applications, we need to analyze a large number of time series. Segments of time series demonstrating dominating advantages over others are often of particular interest. In...
Bin Jiang, Jian Pei
DL
1994
Springer
167views Digital Library» more  DL 1994»
13 years 12 months ago
Administering Structured Documents in Digital Libraries
In this chapter we argue that hyperdocuments administered by digital libraries have to be structured according to standardized storage and exchange formats in order to allow for t...
Klemens Böhm, Karl Aberer, Erich J. Neuhold