227 search results - page 18 / 46 » Complexity Results for Compressing Optimal Paths |
VLDB
2005
ACM
15 years 4 months ago
2005
ACM
Existing work for query processing over graph data models often relies on pre-computing the transitive closure or path indexes. In this paper, we propose a family of stack-based a...
111
click to vote
DOCENG
2006
ACM
15 years 5 months ago
2006
ACM
XPath is the standard declarative language for navigating XML data and returning a set of matching nodes. In the context of XSLT/XQuery analysis, query optimization, and XML type ...
102
click to vote
ICCAD
1995
IEEE
15 years 2 months ago
1995
IEEE
We address the problem of minimizing power consumption in behavioral synthesis of data-dominated circuits. The complex nature of power as a cost function implies that the effects ...
69
Voted
ICIP
1998
IEEE
16 years 20 days ago
1998
IEEE
Motion estimation represents the most computationally intensive task for all efficient motion compensated compression standards. This fact, despite the several eflorts aiming at r...
143
click to vote
WINE
2010
Springer
14 years 9 months ago
2010
Springer
We study Congestion Games with non-increasing cost functions (Cost Sharing Games) from a complexity perspective and resolve their computational hardness, which has been an open que...