159 search results - page 28 / 32 » Soft lambda-Calculus: A Language for Polynomial Time Computa... |
ICALP
2009
Springer
14 years 7 months ago
2009
Springer
We introduce a generic approach for counting subgraphs in a graph. The main idea is to relate counting subgraphs to counting graph homomorphisms. This approach provides new algori...
ICALP
2005
Springer
14 years 1 months ago
2005
Springer
Virtual Private Network Design is the following NP-hard problem. We are given a communication network, represented as a weighted graph with thresholds on the nodes which represent...
WWW
2009
ACM
14 years 8 months ago
2009
ACM
Ad auctions in sponsored search support"broad match"that allows an advertiser to target a large number of queries while bidding only on a limited number. While giving mo...
ICALP
2011
Springer
12 years 11 months ago
2011
Springer
We consider the following Tree-Constrained Bipartite Matching problem: Given two rooted trees T1 = (V1, E1), T2 = (V2, E2) and a weight function w : V1 × V2 → R+, find a maximu...
ICDE
2005
IEEE
14 years 8 months ago
2005
IEEE
We present ViteX, an XPath processing system on XML streams with polynomial time complexity. ViteX uses a polynomial-space data structure to encode an exponential number of patter...