2430 search results - page 233 / 486 » Computing Tutte Polynomials |
140
click to vote
ISPAN
2005
IEEE
15 years 10 months ago
2005
IEEE
In classical mechanism design setting the outcome of the mechanism is computed by a trusted central party. In this paper we consider distributed implementations in which the outco...
181
click to vote
IWPEC
2010
Springer
15 years 2 months ago
2010
Springer
We consider the computational complexity of a problem modeling bribery in the context of voting systems. In the scenario of Swap Bribery, each voter assigns a certain price for swa...
177
click to vote
AMC
2011
14 years 11 months ago
2011
This is a companion paper of [1] and [2]. In the cited papers, using the C-algorithm introduced in [3], many new examples of isochronous centers for Li´enard type equation are fou...
139
click to vote
IEICET
2010
14 years 11 months ago
2010
Polar Fourier Descriptor(PFD) and Spherical Fourier Descriptor(SFD) are rotation invariant feature descriptors for two dimensional(2D) and three dimensional(3D) image retrieval an...
133
click to vote
ICML
2005
IEEE
16 years 5 months ago
2005
IEEE
This paper presents a Support Vector Method for optimizing multivariate nonlinear performance measures like the F1score. Taking a multivariate prediction approach, we give an algo...