104 search results - page 11 / 21 » Range queries over skip tree graphs |
CSR
2007
Springer
14 years 1 months ago
2007
Springer
Consider a family of sets and a single set, called query set. How can one quickly find a member of the family which has a maximal intersection with the query set? Strict time cons...
CVPR
2010
IEEE
14 years 3 months ago
2010
IEEE
This paper presents an algorithm for recovering the globally optimal 2D human figure detection using a loopy graph model. This is computationally challenging because the time comp...
ADVIS
2006
Springer
14 years 1 months ago
2006
Springer
Recently many researchers have focused on management of historical trajectories of moving objects due to numerous size of accumulated data over time. However, most of them are conc...
CIKM
2009
Springer
13 years 11 months ago
2009
Springer
Current approaches to RDF graph indexing suffer from weak data locality, i.e., information regarding a piece of data appears in multiple locations, spanning multiple data structur...
DAGSTUHL
2008
13 years 9 months ago
2008
Allowing templates with infinite domains greatly expands the range of problems that can be formulated as a non-uniform constraint satisfaction problem. It turns out that many CSPs ...