Sciweavers

2430 search results - page 201 / 486
» Computing Tutte Polynomials
Sort
View
JCSS
2002
95views more  JCSS 2002»
15 years 4 months ago
Efficient algorithms for multichromosomal genome rearrangements
Hannenhalli and Pevzner [5] gave a polynomial time algorithm for computing the minimum number of reversals, translocations, fissions, and fusions, that would transform one multichr...
Glenn Tesler
175
Voted
CC
2008
Springer
150views System Software» more  CC 2008»
15 years 4 months ago
Balancing Syntactically Multilinear Arithmetic Circuits
In their seminal paper, Valiant, Skyum, Berkowitz and Rackoff proved that arithmetic circuits can be balanced [VSBR]. That is, [VSBR] showed that for every arithmetic circuit of ...
Ran Raz, Amir Yehudayoff
JSC
2010
96views more  JSC 2010»
15 years 3 months ago
On a generalization of Stickelberger's Theorem
We prove two versions of Stickelberger’s Theorem for positive dimensions and use them to compute the connected and irreducible components of a complex algebraic variety. If the ...
Peter Scheiblechner
ICRA
2010
IEEE
107views Robotics» more  ICRA 2010»
15 years 2 months ago
From motion planning to trajectory control with bounded jerk for service manipulator robots
To build autonomous robots capable to plan and control tasks in human environments, we need a description of trajectories that allows the robot to reason on his moves. In this pape...
Xavier Broquère, Daniel Sidobre, Khoi Nguye...
CORR
2011
Springer
185views Education» more  CORR 2011»
14 years 11 months ago
Asymptotic Moments for Interference Mitigation in Correlated Fading Channels
Abstract—We consider a certain class of large random matrices, composed of independent column vectors with zero mean and different covariance matrices, and derive asymptotically ...
Jakob Hoydis, Mérouane Debbah, Mari Kobayas...