2635 search results - page 388 / 527 » Computing multihomogeneous resultants using straight-line pr... |
ICALP
2004
Springer
14 years 2 months ago
2004
Springer
Abstract. In this paper we consider the problem of computing a minimum cycle basis in a graph G with m edges and n vertices. The edges of G have non-negative weights on them. The p...
SIGGRAPH
2010
ACM
14 years 1 months ago
2010
ACM
We describe a framework for the automatic synthesis of biped locomotion controllers that adapt to uneven terrain at run-time. The framework consists of two components: a per-foots...
ICS
1999
Tsinghua U.
14 years 1 months ago
1999
Tsinghua U.
Programming languages that provide multidimensional arrays and a flat linear model of memory must implement a mapping between these two domains to order array elements in memory....
ICS
2000
Tsinghua U.
14 years 18 days ago
2000
Tsinghua U.
Memory system bottlenecks limit performance for many applications, and computations with strided access patterns are among the hardest hit. The streams used in such applications h...
CSR
2008
Springer
13 years 10 months ago
2008
Springer
The universal cover TG of a connected graph G is the unique (possible infinite) tree covering G, i.e., that allows a locally bijective homomorphism from TG to G. Universal covers h...