1012 search results - page 83 / 203 » Segment intersection searching problems in general settings |
105
click to vote
WWW
2009
ACM
16 years 16 days ago
2009
ACM
In this paper we describe a problem of discovering query clusters from a click-through graph of web search logs. The graph consists of a set of web search queries, a set of pages ...
113
click to vote
SIBGRAPI
2008
IEEE
15 years 6 months ago
2008
IEEE
Range searching is a fundamental problem in computational geometry. The problem involves preprocessing a set of n points in Rd into a data structure, so that it is possible to det...
COMPGEOM
2003
ACM
15 years 5 months ago
2003
ACM
We develop cache-oblivious data structures for orthogonal range searching, the problem of finding all T points in a set of N points in Êd lying in a query hyper-rectangle. Cache...
IJCNN
2006
IEEE
15 years 5 months ago
2006
IEEE
— A heuristic is proposed to address free parameter selection for Support Vector Machines, with the goals of improving generalization performance and providing greater insensitiv...
116
click to vote
COMPGEOM
2006
ACM
15 years 5 months ago
2006
ACM
We extend linkage unfolding results from the well-studied case of polygonal linkages to the more general case of linkages of polygons. More precisely, we consider chains of nonove...