1689 search results - page 102 / 338 » Proximate point searching |
100
Voted
ICTAI
1996
IEEE
15 years 5 months ago
1996
IEEE
In many applications, such as decision support, negotiation, planning, scheduling, etc., one needs to express requirements that can only be partially satisfied. In order to expres...
109
Voted
CCCG
2010
15 years 2 months ago
2010
We present a data structure for efficient axis-aligned orthogonal range search on a set of n lines in a bounded plane. The algorithm requires O(log n + k) time in the worst case t...
102
Voted
DGO
2003
15 years 2 months ago
2003
Connected Kids project is about developing a searchable database system for the disenfranchised people of the city of Troy, New York. The various events and programs for the young...
108
Voted
JAIR
2007
15 years 21 days ago
2007
We present a new algorithm for probabilistic planning with no observability. Our algorithm, called Probabilistic-FF, extends the heuristic forward-search machinery of Conformant-F...
85
Voted
MVA
2002
15 years 13 days ago
2002
Thispaper addresses theproblem in mug shot searching in suspect database. The objective is to improve the eficiency of the suspect identificationprocess. The input is a sketch con...