4057 search results - page 220 / 812 » Linear combination of transformations |
183
click to vote
INFOCOM
1998
IEEE
15 years 10 months ago
1998
IEEE
We consider the problem of constructing logical topologies over a wavelength-routed optical network with no wavelength changers. We present a general linear formulation which consi...
178
click to vote
ALGORITHMICA
1998
15 years 6 months ago
1998
Mallows and Riordan showed in 1968 that labeled trees with a small number of inversions are related to labeled graphs that are connected and sparse. Wright enumerated sparse connec...
185
click to vote
SODA
2010
ACM
16 years 3 months ago
2010
ACM
The hypergraph matching problem is to find a largest collection of disjoint hyperedges in a hypergraph. This is a well-studied problem in combinatorial optimization and graph theo...
187
click to vote
IPSN
2010
Springer
16 years 28 days ago
2010
Springer
Motion capture using wireless inertial measurement units (IMUs) has many advantages over other techniques. Achieving accurate tracking with IMUs presents a processing challenge, e...
185
click to vote
LOPSTR
2009
Springer
16 years 1 months ago
2009
Springer
We show how to combine the two most powerful approaches for automated termination analysis of logic programs (LPs): the direct approach which operates directly on LPs and the trans...