8669 search results - page 74 / 1734 » Computing matrix representations |
STACS
2007
Springer
14 years 3 months ago
2007
Springer
For every k ≥ 1 and two finite fields F and F , we design a polynomial-time algorithm that given a matroid M of branch-width at most k represented over F decides whether M is ...
ENTCS
2008
13 years 9 months ago
2008
In this note we give a new representation for closed sets under which the robust zero set of a function is computable. We call this representation the component cover representati...
HYBRID
1999
Springer
14 years 1 months ago
1999
Springer
Abstract. In this paper we investigate orthogonal polyhedra, i.e. polyhedra which are finite unions of full-dimensional hyper-rectangles. We define representation schemes for the...
COSIT
1999
Springer
14 years 1 months ago
1999
Springer
Abstract. This paper describes some recent cognitively-based and computationally-based research on representing and reasoning about shapes. The cognitive studies are based on proto...
FOCS
2010
IEEE
13 years 7 months ago
2010
IEEE
Let G be a directed edge-weighted graph and let P be a shortest path from s to t in G. The replacement paths problem asks to compute, for every edge e on P, the shortest s-to-t pat...