3946 search results - page 404 / 790 » The computational complexity of choice sets |
254
click to vote
ICIP
2000
IEEE
16 years 8 months ago
2000
IEEE
We present an algorithm that extracts the largest shape within a specificclass, starting from a set of image edgels. The algorithm inherits the Best-First Segmentation approach [jp...
199
click to vote
CAV
2009
Springer
16 years 8 months ago
2009
Springer
Abstract. When a model does not satisfy a given specification, a counterexample is produced by the model checker to demonstrate the failure. A user must then examine the counterexa...
184
click to vote
AAAI
2008
15 years 10 months ago
2008
In a yes/no voting game, a set of voters must determine whether to accept or reject a given alternative. Weighted voting games are a well-studied subclass of yes/no voting games, ...
213
click to vote
ATAL
2008
Springer
15 years 9 months ago
2008
Springer
Mixed multi-unit combinatorial auctions are combinatorial auctions in which the auctioneer and the bidders negotiate over transformations rather than over simple goods. By proposi...
219
click to vote
BMCBI
2010
15 years 7 months ago
2010
Background: A good scoring function is essential for molecular docking computations. In conventional scoring functions, energy terms modeling pairwise interactions are cumulativel...