6045 search results - page 383 / 1209 » Computable Linearizations of Well-partial-orderings |
229
click to vote
CVPR
2010
IEEE
16 years 4 months ago
2010
IEEE
This paper presents a novel method to increase the accuracy
of linear fitting of implicit polynomials. The proposed
method is based on the 3L algorithm philosophy. The novelty
l...
202
click to vote
GD
2006
Springer
15 years 11 months ago
2006
Springer
Tree decompositions of graphs are of fundamental importance in structural and algorithmic graph theory. Planar decompositions generalise tree decompositions by allowing an arbitrar...
181
click to vote
TOG
2008
15 years 7 months ago
2008
Skinning of skeletally deformable models is extensively used for real-time animation of characters, creatures and similar objects. The standard solution, linear blend skinning, ha...
217
click to vote
BIRTHDAY
2010
Springer
15 years 8 months ago
2010
Springer
Many natural problems in computer science concern structures like graphs where elements are not inherently ordered. In contrast, Turing machines and other common models of computa...
213
click to vote
EUROCRYPT
2007
Springer
15 years 11 months ago
2007
Springer
We show an efficient secure two-party protocol, based on Yao's construction, which provides security against malicious adversaries. Yao's original protocol is only secur...