Sciweavers

313 search results - page 22 / 63
» Cost-Based Object Query Optimization
Sort
View
ICDE
2005
IEEE
149views Database» more  ICDE 2005»
15 years 11 months ago
Change Tolerant Indexing for Constantly Evolving Data
Index structures are designed to optimize search performance, while at the same time supporting efficient data updates. Although not explicit, existing index structures are typica...
Reynold Cheng, Yuni Xia, Sunil Prabhakar, Rahul Sh...
ICDE
2000
IEEE
183views Database» more  ICDE 2000»
15 years 11 months ago
Accurate Estimation of the Cost of Spatial Selections
Optimizing queries that involve operations on spatial data requires estimating the selectivity and cost of these operations. In this paper, we focus on estimating the cost of spat...
Ashraf Aboulnaga, Jeffrey F. Naughton
GIS
1995
ACM
15 years 1 months ago
Measuring the Complexity of Polygonal Objects
Polygonal objects are characterized by the following well-known parameters: number of vertices, area, perimeter and so on. These parameters describe the data sets that are used in...
Thomas Brinkhoff, Hans-Peter Kriegel, Ralf Schneid...
ALT
2009
Springer
15 years 6 months ago
Average-Case Active Learning with Costs
Abstract. We analyze the expected cost of a greedy active learning algorithm. Our analysis extends previous work to a more general setting in which different queries have differe...
Andrew Guillory, Jeff A. Bilmes
CLOR
2006
15 years 1 months ago
A Sparse Object Category Model for Efficient Learning and Complete Recognition
We present a "parts and structure" model for object category recognition that can be learnt efficiently and in a weakly-supervised manner: the model is learnt from examp...
Robert Fergus, Pietro Perona, Andrew Zisserman