Sciweavers

2996 search results - page 233 / 600
» Numberings and Randomness
Sort
View
180
Voted
SPAA
2005
ACM
16 years 5 days ago
Admission control to minimize rejections and online set cover with repetitions
We study the admission control problem in general networks. Communication requests arrive over time, and the online algorithm accepts or rejects each request while maintaining the...
Noga Alon, Yossi Azar, Shai Gutner
WISA
2007
Springer
16 years 22 days ago
Breaking 104 Bit WEP in Less Than 60 Seconds
We demonstrate an active attack on the WEP protocol that is able to recover a 104-bit WEP key using less than 40,000 frames with a success probability of 50%. In order to succeed i...
Erik Tews, Ralf-Philipp Weinmann, Andrei Pyshkin
ICML
2004
IEEE
16 years 1 days ago
Kernel-based discriminative learning algorithms for labeling sequences, trees, and graphs
We introduce a new perceptron-based discriminative learning algorithm for labeling structured data such as sequences, trees, and graphs. Since it is fully kernelized and uses poin...
Hisashi Kashima, Yuta Tsuboi
FOCS
2008
IEEE
16 years 1 months ago
Constant-Time Approximation Algorithms via Local Improvements
We present a technique for transforming classical approximation algorithms into constant-time algorithms that approximate the size of the optimal solution. Our technique is applic...
Huy N. Nguyen, Krzysztof Onak
PAKDD
2001
ACM
104views Data Mining» more  PAKDD 2001»
15 years 11 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...