13603 search results - page 2380 / 2721 » On the Complexity of Computing Treelength |
184
click to vote
DAGSTUHL
2004
15 years 8 months ago
2004
We present the Priority R-tree, or PR-tree, which is the first R-tree variant that always answers a window query using O((N/B)1-1/d + T/B) I/Os, where N is the number of ddimensio...
205
click to vote
DAGSTUHL
2006
15 years 8 months ago
2006
Abstract. Similarity search in large multimedia databases requires efficient query processing based on suitable similarity models. Similarity models consist of a feature extraction...
204
click to vote
DAIS
2006
15 years 8 months ago
2006
Abstract. Mobile devices are increasingly aware of their respective locations and vicinity and tend to communicate rather loosely with each other; therefore asynchronous communicat...
186
click to vote
DATESO
2006
15 years 8 months ago
2006
Abstract. This paper describes a few ideas concerned with geographical information systems (GIS) development. Those ideas come from a GIS development project named GeKon, which is ...
191
click to vote
DLT
2006
15 years 8 months ago
2006
Abstract. Boolean grammars [A. Okhotin, Information and Computation 194 (2004) 19-48] are a promising extension of context-free grammars that supports conjunction and negation. In ...