Sciweavers

135 search results - page 8 / 27
» Properties of tree convex constraints
Sort
View
SIAMMA
2010
81views more  SIAMMA 2010»
13 years 3 months ago
Heteroclinic Travelling Waves in Convex FPU-Type Chains
We consider infinite FPU-type atomic chains with general convex potentials and study the existence of monotone fronts that are heteroclinic travelling waves connecting constant asy...
Michael Herrmann, Jens D. M. Rademacher
ICRA
2009
IEEE
81views Robotics» more  ICRA 2009»
14 years 3 months ago
Representing sets of orientations as convex cones
— In a wide range of applications the orientation of a rigid body does not need to be restricted to one given orientation, but can be given as a continuous set of frames. We addr...
Pål Johan From, Jan Tommy Gravdahl
DATE
2007
IEEE
101views Hardware» more  DATE 2007»
14 years 2 months ago
Polynomial-time subgraph enumeration for automated instruction set extension
This paper proposes a novel algorithm that, given a data-flow graph and an input/output constraint, enumerates all convex subgraphs under the given constraint in polynomial time ...
Paolo Bonzini, Laura Pozzi
SIGMOD
2008
ACM
127views Database» more  SIGMOD 2008»
13 years 8 months ago
Minimization of tree pattern queries with constraints
Tree pattern queries (TPQs) provide a natural and easy formalism to query tree-structured XML data, and the efficient processing of such queries has attracted a lot of attention. ...
Ding Chen, Chee Yong Chan
WEA
2010
Springer
330views Algorithms» more  WEA 2010»
14 years 3 months ago
Exact Bipartite Crossing Minimization under Tree Constraints
A tanglegram consists of a pair of (not necessarily binary) trees T1, T2 with leaf sets L1, L2. Additional edges, called tangles, may connect nodes in L1 with those in L2. The task...
Frank Baumann, Christoph Buchheim, Frauke Liers