Sciweavers

55 search results - page 11 / 11
» A benchmark for evaluating moving object indexes
Sort
View
SSDBM
2006
IEEE
122views Database» more  SSDBM 2006»
13 years 11 months ago
Probabilistic Ranking Queries on Gaussians
In many modern applications, there are no exact values available to describe the data objects. Instead, the feature values are considered to be uncertain. This uncertainty is mode...
Christian Böhm, Alexey Pryakhin, Matthias Sch...
GECCO
2007
Springer
186views Optimization» more  GECCO 2007»
13 years 11 months ago
ICSPEA: evolutionary five-axis milling path optimisation
ICSPEA is a novel multi-objective evolutionary algorithm which integrates aspects from the powerful variation operators of the Covariance Matrix Adaptation Evolution Strategy (CMA...
Jörn Mehnen, Rajkumar Roy, Petra Kersting, To...
TKDE
2008
156views more  TKDE 2008»
13 years 4 months ago
A Framework for Mining Sequential Patterns from Spatio-Temporal Event Data Sets
Given a large spatio-temporal database of events, where each event consists of the fields event ID, time, location, and event type, mining spatio-temporal sequential patterns ident...
Yan Huang, Liqin Zhang, Pusheng Zhang
JCDL
2011
ACM
301views Education» more  JCDL 2011»
12 years 7 months ago
Archiving the web using page changes patterns: a case study
A pattern is a model or a template used to summarize and describe the behavior (or the trend) of a data having generally some recurrent events. Patterns have received a considerab...
Myriam Ben Saad, Stéphane Gançarski
SIGMOD
2002
ACM
112views Database» more  SIGMOD 2002»
14 years 5 months ago
Minimal probing: supporting expensive predicates for top-k queries
This paper addresses the problem of evaluating ranked top-? queries with expensive predicates. As major DBMSs now all support expensive user-defined predicates for Boolean queries...
Kevin Chen-Chuan Chang, Seung-won Hwang