Sciweavers

2853 search results - page 405 / 571
» Finding related tables
Sort
View
KDD
1997
ACM
213views Data Mining» more  KDD 1997»
14 years 11 days ago
A Probabilistic Approach to Fast Pattern Matching in Time Series Databases
Theproblemof efficiently and accurately locating patterns of interest in massivetimeseries data sets is an important and non-trivial problemin a wide variety of applications, incl...
Eamonn J. Keogh, Padhraic Smyth
SIGMOD
1996
ACM
84views Database» more  SIGMOD 1996»
14 years 11 days ago
Change Detection in Hierarchically Structured Information
Detecting and representing changes to data is important for active databases, data warehousing, view maintenance, and version and configuration management. Most previous work in c...
Sudarshan S. Chawathe, Anand Rajaraman, Hector Gar...
SIGGRAPH
1994
ACM
14 years 9 days ago
The irradiance Jacobian for partially occluded polyhedral sources
The irradiance at a point on a surface due to a polyhedral source of uniform brightness is given by a well-known analytic formula. In this paper we derive the corresponding analyt...
James Arvo
ISAAC
1992
Springer
132views Algorithms» more  ISAAC 1992»
14 years 9 days ago
Generalized Assignment Problems
In the multilevel generalized assignment problem (MGAP) agents can perform tasks at more than one efficiency level. Important manufacturing problems, such as lot sizing, can be ea...
Silvano Martello, Paolo Toth
STOC
1992
ACM
122views Algorithms» more  STOC 1992»
14 years 9 days ago
Existence and Construction of Edge Disjoint Paths on Expander Graphs
Given an expander graph G = (V, E) and a set of q disjoint pairs of vertices in V , we are interested in finding for each pair (ai, bi), a path connecting ai to bi, such that the ...
Andrei Z. Broder, Alan M. Frieze, Eli Upfal