1012 search results - page 115 / 203 » Segment intersection searching problems in general settings |
154
click to vote
COMGEO
2012
ACM
14 years 9 days ago
2012
ACM
A straight-line drawing of a plane graph G is a planar drawing of G, where each vertex is drawn as a point and each edge is drawn as a straight line segment. Given a set S of n poi...
144
Voted
CLEF
2005
Springer
15 years 10 months ago
2005
Springer
This paper reports results for the University of Maryland’s participation in CLEF-2005 Cross-Language Speech Retrieval track. Techniques that were tried include: (1) document ex...
126
click to vote
PR
2006
15 years 4 months ago
2006
A conventional way to discriminate between objects represented by dissimilarities is the nearest neighbor method. A more efficient and sometimes a more accurate solution is offere...
119
Voted
IEICET
2006
15 years 4 months ago
2006
A problem of arranging n points as uniformly as possible, which is equivalent to that of packing n equal and non-overlapping circles in a unit square, is frequently asked. In this ...
146
click to vote
AI
1999
Springer
15 years 4 months ago
1999
Springer
Bucket elimination is an algorithmic framework that generalizes dynamic programming to accommodate many problem-solving and reasoning tasks. Algorithms such as directional-resolut...