5606 search results - page 329 / 1122 » Randomization Techniques for Graphs. |
166
click to vote
ICASSP
2009
IEEE
16 years 1 months ago
2009
IEEE
This paper addresses the problem of image retrieval from an encrypted database, where data confidentiality is preserved both in the storage and retrieval process. The paper focus...
160
click to vote
TC
2008
15 years 6 months ago
2008
Multimedia applications usually have throughput constraints. An implementation must meet these constraints, while it minimizes resource usage and energy consumption. The compute in...
292
click to vote
SIGMOD
2007
ACM
16 years 6 months ago
2007
ACM
Graphs are prevalently used to model the relationships between objects in various domains. With the increasing usage of graph databases, it has become more and more demanding to e...
201
click to vote
EDBT
2009
ACM
16 years 1 months ago
2009
ACM
In recent years, large amount of data modeled by graphs, namely graph data, have been collected in various domains. Efficiently processing queries on graph databases has attracted...
148
click to vote
GD
2007
Springer
16 years 23 days ago
2007
Springer
Abstract. Constrained stress majorization is a promising new technique for integrating application specific layout constraints into forcedirected graph layout. We significantly i...