1388 search results - page 221 / 278 » Querying Linguistic Trees |
125
click to vote
FOCS
1998
IEEE
15 years 4 months ago
1998
IEEE
We examine the number T of queries that a quantum network requires to compute several Boolean functions on f0;1gN in the black-box model. We show that, in the blackbox model, the ...
116
click to vote
CPM
2006
Springer
15 years 4 months ago
2006
Springer
The Range-Minimum-Query-Problem is to preprocess an array such that the position of the minimum element between two specified indices can be obtained efficiently. We present a dire...
100
Voted
ECCV
2010
Springer
15 years 2 months ago
2010
Springer
We seek to recognize the place depicted in a query image using a database of “street side” images annotated with geolocation information. This is a challenging task due to chan...
97
Voted
CORR
2008
Springer
15 years 18 days ago
2008
Springer
A purely relational account of the true XQuery semantics can turn any relational database system into an XQuery processor. Compiling nested expressions of the fully compositional X...
193
Voted
SIGMOD
2009
ACM
16 years 22 days ago
2009
ACM
This paper addresses the problem of monitoring the k nearest neighbors to a dynamically changing path in road networks. Given a destination where a user is going to, this new quer...