9842 search results - page 1344 / 1969 » The Complexity of the Matching-Cut Problem |
359
click to vote
STOC
2003
ACM
16 years 7 months ago
2003
ACM
In dynamic stabbing, we operate on a dynamic set of intervals. A stabbing query asks for an interval containing a given point. This basic problem encodes problems such as method l...
285
click to vote
VLDB
2003
ACM
16 years 7 months ago
2003
ACM
Data warehousing systems integrate information from operational data sources into a central repository to enable analysis and mining of the integrated information. During the integ...
196
click to vote
PODS
2005
ACM
16 years 7 months ago
2005
ACM
We consider here the exchange of Active XML (AXML) data, i.e., XML documents where some of the data is given explicitly while other parts are given only intensionally as calls to ...
192
click to vote
PODS
2008
ACM
16 years 7 months ago
2008
ACM
In the rank join problem, we are given a set of relations and a scoring function, and the goal is to return the join results with the top K scores. It is often the case in practic...
196
click to vote
ICS
2010
Tsinghua U.
16 years 4 months ago
2010
Tsinghua U.
In this paper we study the possibility of proving the existence of one-way functions based on average case hardness. It is well-known that if there exists a polynomial-time sample...