1012 search results - page 96 / 203 » Segment intersection searching problems in general settings |
181
click to vote
CORR
2010
Springer
15 years 5 months ago
2010
Springer
In this paper we show how the complexity of performing nearest neighbor (NNS) search on a metric space is related to the expansion of the metric space. Given a metric space we loo...
173
click to vote
CIKM
2008
Springer
15 years 7 months ago
2008
Springer
Random projection (RP) is a common technique for dimensionality reduction under L2 norm for which many significant space embedding results have been demonstrated. However, many si...
163
click to vote
IR
2007
15 years 5 months ago
2007
This paper reports on the underlying IR problems encountered when indexing and searching with the Bulgarian language. For this language we propose a general light stemmer and demon...
225
click to vote
KDD
2012
ACM
13 years 7 months ago
2012
ACM
Multi-instance multi-label learning (MIML) is a framework for supervised classification where the objects to be classified are bags of instances associated with multiple labels....
136
click to vote
COMPGEOM
2004
ACM
15 years 10 months ago
2004
ACM
We study the problem of computing the visibility graph defined by a set P of n points inside a polygon Q: two points p, q ∈ P are joined by an edge if the segment pq ⊂ Q. Ef...