151 search results - page 18 / 31 » Tight Bounds for Graph Problems in Insertion Streams |
129
Voted
GD
2004
Springer
15 years 9 months ago
2004
Springer
We study 3-dimensional layouts of the hypercube in a 1-active layer and general model. The problem can be understood as a graph drawing problem in 3D space and was addressed at Gr...
144
click to vote
PAMI
2007
15 years 3 months ago
2007
A new framework is presented for both understanding and developing graph-cut based combinatorial algorithms suitable for the approximate optimization of a very wide class of MRFs ...
121
Voted
PODC
2009
ACM
16 years 4 months ago
2009
ACM
d Abstract] Prosenjit Bose School of Computer Science Carleton University Ottawa, Canada jit@scs.carleton.ca Paz Carmi Dept. of Computer Science Ben-Gurion Univ. of the Negev Beer-...
114
click to vote
WDAG
2007
Springer
15 years 10 months ago
2007
Springer
A group of identical mobile agents moving asynchronously among the nodes of an anonymous network have to gather together in a single node of the graph. This problem known as the (a...
180
click to vote
JCST
2008
15 years 3 months ago
2008
Detecting duplicates in data streams is an important problem that has a wide range of applications. In general, precisely detecting duplicates in an unbounded data stream is not fe...