4541 search results - page 196 / 909 » Cache-Oblivious Algorithms and Data Structures |
149
click to vote
CIKM
2009
Springer
15 years 9 months ago
2009
Springer
With the ubiquity of information networks and their broad applications, the issue of similarity computation between entities of an information network arises and draws extensive r...
115
click to vote
ISAAC
2009
Springer
15 years 9 months ago
2009
Springer
The problem of maintaining geometric structures for points in motion has been well studied over the years. Much theoretical work to date has been based on the assumption that point...
120
click to vote
IS
2010
15 years 1 months ago
2010
Given a hypergraph and a set of embedded functional dependencies, we investigate the problem of determining the conditions under which we can efficiently generate redundancy-free ...
126
click to vote
ICMCS
2005
IEEE
15 years 9 months ago
2005
IEEE
Motivated by the needs for efficient indexing structures adapted to real applications in video database, we present a new indexing structure named Kpyr. In Kpyr, we use a clusteri...
233
Voted
ICDE
2003
IEEE
16 years 4 months ago
2003
IEEE
Structural join operations are central to evaluating queries against XML data, and are typically responsible for consuming a lion's share of the query processing time. Thus, ...