Sciweavers

4850 search results - page 337 / 970
» Approximate Data Structures with Applications
Sort
View
SDM
2009
SIAM
164views Data Mining» more  SDM 2009»
16 years 3 months ago
Exact Discovery of Time Series Motifs.
Time series motifs are pairs of individual time series, or subsequences of a longer time series, which are very similar to each other. As with their discrete analogues in computat...
Abdullah Mueen, Eamonn J. Keogh, M. Brandon Westov...
163
Voted
GECCO
2005
Springer
124views Optimization» more  GECCO 2005»
16 years 7 days ago
Evolving petri nets to represent metabolic pathways
Given concentrations of metabolites over a sequence of time steps, the metabolic pathway prediction problem seeks a set of reactions and rate constants for them that could yield t...
Jeremiah Nummela, Bryant A. Julstrom
VLDB
2007
ACM
229views Database» more  VLDB 2007»
16 years 25 days ago
Sum-Max Monotonic Ranked Joins for Evaluating Top-K Twig Queries on Weighted Data Graphs
In many applications, the underlying data (the web, an XML document, or a relational database) can be seen as a graph. These graphs may be enriched with weights, associated with t...
Yan Qi 0002, K. Selçuk Candan, Maria Luisa ...
SIGMOD
2002
ACM
219views Database» more  SIGMOD 2002»
16 years 6 months ago
Efficient k-NN search on vertically decomposed data
Applications like multimedia retrieval require efficient support for similarity search on large data collections. Yet, nearest neighbor search is a difficult problem in high dimen...
Arjen P. de Vries, Nikos Mamoulis, Niels Nes, Mart...
CIA
2006
Springer
15 years 10 months ago
Eliminating Interdependencies Between Issues for Multi-issue Negotiation
In multi-issue negotiations, issues may be negotiated independently or not. In the latter case, the utility associated with one issue depends on the value of another. These issue d...
Koen V. Hindriks, Catholijn M. Jonker, Dmytro Tykh...