2430 search results - page 425 / 486 » Computing Tutte Polynomials |
137
Voted
CADE
2009
Springer
15 years 9 months ago
2009
Springer
Abstract. The problem of computing Craig interpolants in SMT has recently received a lot of interest, mainly for its applications in formal verification. Efficient algorithms for ...
107
Voted
ATAL
2009
Springer
15 years 9 months ago
2009
Springer
This paper analyzes bilateral multi-issue negotiation between selfinterested agents. Specifically, we consider the case where issues are divisible, there are time constraints in ...
126
Voted
COMPGEOM
2009
ACM
15 years 9 months ago
2009
ACM
Given a set system (X, R), the hitting set problem is to find a smallest-cardinality subset H ⊆ X, with the property that each range R ∈ R has a non-empty intersection with H...
131
click to vote
CVPR
2007
IEEE
15 years 9 months ago
2007
IEEE
Energy-minimizing active contour models (snakes) have been proposed for solving many computer vision problems such as object segmentation, surface reconstruction, and object track...
95
Voted
MLG
2007
Springer
15 years 8 months ago
2007
Springer
We give a universal kernel that renders all the regular languages linearly separable. We are not able to compute this kernel efficiently and conjecture that it is intractable, but...