2430 search results - page 236 / 486 » Computing Tutte Polynomials |
206
click to vote
WADS
2005
Springer
16 years 16 days ago
2005
Springer
We consider an APX-hard variant (∆-Max-ATSP) and an APX-hard relaxation (Max-3-DCC) of the classical traveling salesman problem. We present a 31 40-approximation algorithm for ...
183
click to vote
ICALP
2004
Springer
16 years 13 days ago
2004
Springer
The analysis of security protocols requires precise formulations of the knowledge of protocol participants and attackers. In formal approaches, this knowledge is often treated in t...
182
click to vote
CSB
2003
IEEE
16 years 10 days ago
2003
IEEE
We have developed a novel algorithm for protein backbone structure determination using global orientational restraints on internuclear bond vectors derived from residual dipolar c...
155
click to vote
PG
2003
IEEE
16 years 10 days ago
2003
IEEE
In this paper, we propose efficient numerical techniques for Butterworth filtering and implicit fairing of large irregular triangle meshes, where the corresponding filters are ...
156
click to vote
ICRA
2002
IEEE
15 years 12 months ago
2002
IEEE
We consider the task of assembling a large number of self controlled parts (or robots) into copies of a prescribed assembly (or formation). In particular, we introduce a way to sy...