Sciweavers

3891 search results - page 288 / 779
» Query Models
Sort
View
ECML
2006
Springer
15 years 10 months ago
Ensembles of Nearest Neighbor Forecasts
Nearest neighbor forecasting models are attractive with their simplicity and the ability to predict complex nonlinear behavior. They rely on the assumption that observations simila...
Dragomir Yankov, Dennis DeCoste, Eamonn J. Keogh
PVLDB
2010
269views more  PVLDB 2010»
15 years 4 months ago
Shortest Path Computation on Air Indexes
Shortest path computation is one of the most common queries in location-based services that involve transportation networks. Motivated by scalability challenges faced in the mobil...
Georgios Kellaris, Kyriakos Mouratidis
CORR
2010
Springer
157views Education» more  CORR 2010»
15 years 6 months ago
Efficient Clustering with Limited Distance Information
Given a point set S and an unknown metric d on S, we study the problem of efficiently partitioning S into k clusters while querying few distances between the points. In our model ...
Konstantin Voevodski, Maria-Florina Balcan, Heiko ...
SMA
1997
ACM
120views Solid Modeling» more  SMA 1997»
15 years 10 months ago
The Generic Geometric Complex (GGC): A Modeling Scheme for Families of Decomposed Pointsets
: Modeling of families of geometric objects is a major topic in modern geometric and solid modeling. Object families are central to many important solid modeling applications, incl...
Ari Rappoport
ICDE
1998
IEEE
147views Database» more  ICDE 1998»
16 years 7 months ago
The Effect of Buffering on the Performance of R-Trees
?Past R-tree studies have focused on the number of nodes visited as a metric of query performance. Since database systems usually include a buffering mechanism, we propose that the...
Scott T. Leutenegger, Mario A. Lopez