1629 search results - page 151 / 326 » Hardness Results and Efficient Algorithms for Graph Powers |
140
click to vote
SIGIR
2011
ACM
14 years 1 months ago
2011
ACM
As the Internet grows explosively, search engines play a more and more important role for users in effectively accessing online information. Recently, it has been recognized that ...
SLIP
2009
ACM
15 years 4 months ago
2009
ACM
This paper proposes an efficient method to predict the worst case of voltage violation by multi-domain clock gating in a three-dimensional (3D) on-chip power network considering l...
PODS
2005
ACM
15 years 10 months ago
2005
ACM
The challenge of monitoring massive amounts of data generated by communication networks has led to the interest in data stream processing. We study streams of edges in massive com...
157
click to vote
ICDT
2009
ACM
15 years 11 months ago
2009
ACM
Graph-theoretic aggregation problems have been considered both in OLAP (grid graph) and XML (tree). This paper gives new results for MIN aggregation in a tree, where we want the M...
87
Voted
ICCD
2002
IEEE
15 years 7 months ago
2002
IEEE
Boolean functions are fundamental to synthesis and verification of digital logic, and compact representations of Boolean functions have great practical significance. Popular repre...