902 search results - page 111 / 181 » R* Search |
157
click to vote
FAABS
2004
Springer
15 years 11 months ago
2004
Springer
Abstract. The task addressed here is a dynamic search through a bounded region, while avoiding multiple large obstacles, such as buildings. In the case of limited sensors and commu...
159
click to vote
COMPGEOM
2007
ACM
15 years 10 months ago
2007
ACM
We propose a simple variant of kd-trees, called rank-based kd-trees, for sets of points in Rd . We show that a rank-based kd-tree, like an ordinary kd-tree, supports range search ...
155
click to vote
CLEF
2008
Springer
15 years 8 months ago
2008
Springer
In this paper we will briefly describe the approaches taken by Berkeley for the main GeoCLEF 2008 tasks (Mono and Bilingual retrieval). The approach this year used probabilistic t...
198
click to vote
COORDINATION
2008
Springer
15 years 8 months ago
2008
Springer
Abstract. The deployment of Share Data Spaces in open, possibly hostile, environments arises the need of protecting the confidentiality of the data space content. Existing approach...
198
click to vote
IJCAI
1989
15 years 7 months ago
1989
entional user behavior, we need a principled mannerAbstract for relaxing contextual constraints when they are violated.When computer speech recognition is used for problem In order...