151 search results - page 23 / 31 » Tight Bounds for Graph Problems in Insertion Streams |
130
click to vote
PODS
2003
ACM
16 years 4 months ago
2003
ACM
Watermarking allows robust and unobtrusive insertion of information in a digital document. Very recently, techniques have been proposed for watermarking relational databases or XM...
144
click to vote
PLDI
2004
ACM
15 years 9 months ago
2004
ACM
+ Modern network processors employ multi-threading to allow concurrency amongst multiple packet processing tasks. We studied the properties of applications running on the network p...
124
click to vote
ADAEUROPE
2004
Springer
15 years 9 months ago
2004
Springer
The tree width of a graph G measures how close G is to being a tree or a series-parallel graph. Many well-known problems that are otherwise NP-complete can be solved efficiently if...
137
click to vote
SWAT
2004
Springer
15 years 9 months ago
2004
Springer
We show that any priority queue data structure that supports insert, delete, and find-min operations in pq(n) time, when n is an upper bound on the number of elements in the prio...
114
click to vote
MOR
2010
15 years 2 months ago
2010
We consider the problem of locating a facility on a network, represented by a graph. A set of strategic agents have different ideal locations for the facility; the cost of an age...