970 search results - page 96 / 194 » On encodings of spanning trees |
PODC
2003
ACM
14 years 2 months ago
2003
ACM
We consider the model of unreliable network links, where at each time unit a link might be either up or down. We consider two related problems. The first, establishing end to end...
COMPGEOM
1993
ACM
14 years 1 months ago
1993
ACM
For a polygon P, the bounded Voronoi diagram of P is a partition of P into regions assigned to the vertices of P. A point p inside P belongs to the region of a vertex v if and onl...
COCOON
2006
Springer
14 years 19 days ago
2006
Springer
Abstract. While the complexity of min-max and min-max regret versions of most classical combinatorial optimization problems has been thoroughly investigated, there are very few stu...
IPCO
2010
13 years 10 months ago
2010
Hypergraph multiway cut problem is a problem of finding a minimum capacity set of hyperedges whose removal divides a given hypergraph into a specified number of connected componen...
LREC
2008
13 years 10 months ago
2008
We describe ongoing work in semi-automatic annotating corpus, with the goal to answer "why" question in question answering system and give a construction of the coherent...