2430 search results - page 268 / 486 » Computing Tutte Polynomials |
167
click to vote
CCECE
2006
IEEE
15 years 10 months ago
2006
IEEE
In this paper, we introduce new algorithms for selecting taxon samples from large evolutionary trees, maintaining uniformity and randomness, under certain new constraints on the t...
114
Voted
SIBGRAPI
2006
IEEE
15 years 10 months ago
2006
IEEE
The estimation of multiple orientations in multidimensional signals is a strongly non-linear problem to which a two-step solution is here presented. First, the problem is lineariz...
133
Voted
ACG
2006
Springer
15 years 10 months ago
2006
Springer
A method to simulate the physics of the game of pool is presented. The method is based upon a parametrization of ball motion which allows the time of occurrence of events, such as...
124
click to vote
ACMSE
2006
ACM
15 years 10 months ago
2006
ACM
Although the satisfiability problem (SAT) is NP-complete, state-of-the-art solvers for SAT can solve instances that are considered to be very hard. Emerging applications demand t...
132
click to vote
FOCS
2005
IEEE
15 years 9 months ago
2005
IEEE
We present a polynomial time algorithm based on semidefinite programming that, given a unique game of value 1 − O(1/ log n), satisfies a constant fraction of constraints, wher...