Sciweavers

1091 search results - page 98 / 219
» On the temporal dimension of search
Sort
View
210
Voted
IJCAI
1989
15 years 8 months ago
Goal Ordering in Partially Ordered Plans
Partially ordered plans have not solved the goal ordering problem. Consider: a goal in a par­ tially ordered plan is an operator precondition that is not yet achieved; operators,...
Mark Drummond, Ken Currie
TASLP
2008
154views more  TASLP 2008»
15 years 6 months ago
Capturing Local Variability for Speaker Normalization in Speech Recognition
The new model reduces the impact of local spectral and temporal variability by estimating a finite set of spectral and temporal warping factors which are applied to speech at the f...
Antonio Miguel, Eduardo Lleida, Richard Rose, Luis...
GIS
1998
ACM
15 years 6 months ago
Aoristic Crime Analysis
Abstract. Crime pattern analysis has tended to focus on `hotspot’ analysis techniques; the identi® cation of areas with higher densities of criminal activity. This paper documen...
Jerry H. Ratcliffe, Michael J. McCullagh
201
Voted
ICALP
2004
Springer
16 years 10 days ago
The Black-Box Complexity of Nearest Neighbor Search
We define a natural notion of efficiency for approximate nearest-neighbor (ANN) search in general n-point metric spaces, namely the existence of a randomized algorithm which answ...
Robert Krauthgamer, James R. Lee
258
Voted
COMPGEOM
2010
ACM
16 years 1 days ago
A dynamic data structure for approximate range searching
In this paper, we introduce a simple, randomized dynamic data structure for storing multidimensional point sets, called a quadtreap. This data structure is a randomized, balanced ...
David M. Mount, Eunhui Park