2430 search results - page 127 / 486 » Computing Tutte Polynomials |
365
click to vote
RECOMB
2012
Springer
13 years 7 months ago
2012
Springer
We develop a novel and general approach to estimating the accuracy of protein multiple sequence alignments without knowledge of a reference alignment, and use our approach to addre...
177
Voted
COLT
1993
Springer
15 years 9 months ago
1993
Springer
The Vapnik-Chervonenkis (V-C) dimension is an important combinatorial tool in the analysis of learning problems in the PAC framework. For polynomial learnability, we seek upper bou...
136
click to vote
ICALP
2009
Springer
15 years 11 months ago
2009
Springer
Let Φ be a uniformly distributed random k-SAT formula with n variables and m clauses. We present a polynomial time algorithm that finds a satisfying assignment of Φ with high p...
125
click to vote
IH
2005
Springer
15 years 10 months ago
2005
Springer
We examine the problem of watermarking schemes robust against geometric distortions from a complexity theoretic point of view. The main results presented are polynomial time reduct...
131
Voted
ICRA
2000
IEEE
15 years 9 months ago
2000
IEEE
This paper describes a new collision detection algorithm designed for interactive manipulation in virtual environments. Making some assumptions on objects motion, the collision ti...