4926 search results - page 850 / 986 » Two Graph Algorithms On an Associative Computing Model |
KDD
2008
ACM
14 years 8 months ago
2008
ACM
A hypergraph is a generalization of the traditional graph in which the edges are arbitrary non-empty subsets of the vertex set. It has been applied successfully to capture highord...
SIGMOD
2012
ACM
11 years 10 months ago
2012
ACM
While extensive work has been done on evaluating queries over tuple-independent probabilistic databases, query evaluation over correlated data has received much less attention eve...
BROADNETS
2007
IEEE
14 years 2 months ago
2007
IEEE
Abstract—To reap the benefits of advances in wireless technologies as well as provide backward compatibility with current investments, future wireless routers that constitute th...
JACM
2000
13 years 7 months ago
2000
A simple variant of a priority queue, called a soft heap, is introduced. The data structure supports the usual operations: insert, delete, meld, and findmin. Its novelty is to beat...
CVPR
2012
IEEE
11 years 10 months ago
2012
IEEE
Depth ordering is instrumental for understanding the 3D geometry of an image. We as humans are surprisingly good ordering even with abstract 2D line drawings. In this paper we pro...