Sciweavers

3422 search results - page 213 / 685
» Random Subset Optimization
Sort
View
ISAAC
2007
Springer
93views Algorithms» more  ISAAC 2007»
16 years 16 days ago
Dilation-Optimal Edge Deletion in Polygonal Cycles
Abstract. Let C be a polygonal cycle on n vertices in the plane. A randomized algorithm is presented which computes in O(n log3 n) expected time, the edge of C whose removal result...
Hee-Kap Ahn, Mohammad Farshi, Christian Knauer, Mi...
CRYPTO
2001
Springer
106views Cryptology» more  CRYPTO 2001»
15 years 11 months ago
Forward-Secure Signatures with Optimal Signing and Verifying
We propose the first forward-secure signature scheme for which both signing and verifying are as efficient as for one of the most efficient ordinary signature schemes (Guillou-Qui...
Gene Itkis, Leonid Reyzin
PAKDD
2001
ACM
104views Data Mining» more  PAKDD 2001»
15 years 10 months ago
Optimizing the Induction of Alternating Decision Trees
The alternating decision tree brings comprehensibility to the performance enhancing capabilities of boosting. A single interpretable tree is induced wherein knowledge is distribute...
Bernhard Pfahringer, Geoffrey Holmes, Richard Kirk...
AINA
2004
IEEE
15 years 10 months ago
RED with Optimized Dynamic Threshold Deployment on Shared Buffer
Prior survey of RED algorithm deployment on multiqueue system with shared buffer was unfair and sensitive to congestion level by statically setting the parameters. In this paper, ...
Chengchen Hu, Bin Liu
137
Voted
EUROPAR
2008
Springer
15 years 8 months ago
Deque-Free Work-Optimal Parallel STL Algorithms
This paper presents provable work-optimal parallelizations of STL (Standard Template Library) algorithms based on the workstealing technique. Unlike previous approaches where a deq...
Daouda Traoré, Jean-Louis Roch, Nicolas Mai...