1629 search results - page 91 / 326 » Hardness Results and Efficient Algorithms for Graph Powers |
185
click to vote
ICDE
2003
IEEE
15 years 11 months ago
2003
IEEE
XKeyword provides efficient keyword proximity queries on large XML graph databases. A query is simply a list of keywords and does not require any schema or query language knowledg...
AUTOMATICA
2008
14 years 10 months ago
2008
This paper presents analysis and design results for distributed consensus algorithms in multi-agent networks. We consider continuous consensus functions of the initial state of th...
130
click to vote
CVPR
2009
IEEE
16 years 5 months ago
2009
IEEE
In this paper, we introduce a higher-order MRF optimization
framework. On the one hand, it is very general;
we thus use it to derive a generic optimizer that can be applied
to a...
KDD
2008
ACM
15 years 10 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...
SENSYS
2006
ACM
15 years 3 months ago
2006
ACM
Extensive empirical studies presented in this paper confirm that the quality of radio communication between low power sensor devices varies significantly with time and environme...