85 search results - page 14 / 17 » Fast and practical indexing and querying of very large graph... |
IJCM
2007
14 years 9 months ago
2007
The highest fidelity representations of realistic real-world materials currently used comprise Bidirectional Texture Functions (BTF). The BTF is a six dimensional function dependi...
STOC
2003
ACM
15 years 10 months ago
2003
ACM
We study novel combinatorial properties of graphs that allow us to devise a completely new approach to dynamic all pairs shortest paths problems. Our approach yields a fully dynam...
105
click to vote
PARCO
1997
14 years 11 months ago
1997
During the last decade, all commercial database systems have included features for parallel processing into their products. This development has been driven by the fact that datab...
182
click to vote
ICDE
2007
IEEE
15 years 11 months ago
2007
IEEE
Logical constraints, (e.g., 'phone numbers in toronto can have prefixes 416, 647, 905 only'), are ubiquitous in relational databases. Traditional integrity constraints, ...
BMCBI
2006
14 years 9 months ago
2006
Background: In recent times, there has been an exponential rise in the number of protein structures in databases e.g. PDB. So, design of fast algorithms capable of querying such d...