2412 search results - page 158 / 483 » Which Problems Have Strongly Exponential Complexity |
141
click to vote
MCS
2005
Springer
15 years 9 months ago
2005
Springer
Mixed Group Ranks is a parametric method for combining rank based classi ers that is eective for many-class problems. Its parametric structure combines qualities of voting methods...
128
click to vote
CAV
2008
Springer
15 years 5 months ago
2008
Springer
Although there are many efficient algorithms for calculating the simulation preorder on finite Kripke structures, only two have been proposed of which the space complexity is of t...
135
Voted
INFORMS
1998
15 years 3 months ago
1998
The problem of discriminating between two nite point sets in n-dimensional feature space by a separating plane that utilizes as few of the features as possible, is formulated as a...
124
Voted
WOTE
2010
15 years 1 months ago
2010
Optical mark-sense scanning has lead to a resurgence in the use of paper ballots in the United States, despite a century of strong competition from paperless direct-recording votin...
138
Voted
ICNP
1997
IEEE
15 years 7 months ago
1997
IEEE
TCP's ability to share a bottleneck fairly and efficiently decreases as the number of competing flows increases. This effect starts to appear when there are more flows than p...