1802 search results - page 324 / 361 » Complexity Theory for Operators in Analysis |
202
click to vote
STOC
2007
ACM
16 years 5 months ago
2007
ACM
In the MINIMUM BOUNDED DEGREE SPANNING TREE problem, we are given an undirected graph with a degree upper bound Bv on each vertex v, and the task is to find a spanning tree of min...
153
click to vote
STOC
2006
ACM
16 years 5 months ago
2006
ACM
We study the maximum edge-disjoint paths problem in undirected planar graphs: given a graph G and node pairs s1t1, s2t2, . . ., sktk, the goal is to maximize the number of pairs t...
228
click to vote
SIGMOD
2008
ACM
16 years 5 months ago
2008
ACM
Pattern matching over event streams is increasingly being employed in many areas including financial services, RFIDbased inventory management, click stream analysis, and electroni...
166
click to vote
PODS
2006
ACM
16 years 5 months ago
2006
ACM
d Abstract] Guizhen Yang Artificial Intelligence Center SRI International Menlo Park, CA 94025, USA Michael Kifer Dept. of Computer Science Stony Brook University Stony Brook, NY 1...
191
click to vote
PODS
2008
ACM
16 years 5 months ago
2008
ACM
We present a novel definition of privacy in the framework of offline (retroactive) database query auditing. Given information about the database, a description of sensitive data, ...