Sciweavers

1289 search results - page 222 / 258
» Complexity of Counting the Optimal Solutions
Sort
View
ICML
2010
IEEE
14 years 10 months ago
Multi-Class Pegasos on a Budget
When equipped with kernel functions, online learning algorithms are susceptible to the "curse of kernelization" that causes unbounded growth in the model size. To addres...
Zhuang Wang, Koby Crammer, Slobodan Vucetic
ICML
2010
IEEE
14 years 10 months ago
Boosting Classifiers with Tightened L0-Relaxation Penalties
We propose a novel boosting algorithm which improves on current algorithms for weighted voting classification by striking a better balance between classification accuracy and the ...
Noam Goldberg, Jonathan Eckstein
ADHOC
2008
183views more  ADHOC 2008»
14 years 10 months ago
On ant routing algorithms in ad hoc networks with critical connectivity
This paper shows a novel self-organizing approach for routing datagrams in ad hoc networks, called Distributed Ant Routing (DAR). This approach belongs to the class of routing alg...
Laura Rosati, Matteo Berioli, Gianluca Reali
BIODATAMINING
2008
85views more  BIODATAMINING 2008»
14 years 10 months ago
A review of estimation of distribution algorithms in bioinformatics
Evolutionary search algorithms have become an essential asset in the algorithmic toolbox for solving high-dimensional optimization problems in across a broad range of bioinformati...
Rubén Armañanzas, Iñaki Inza,...
COMCOM
2008
91views more  COMCOM 2008»
14 years 9 months ago
A WEP post-processing algorithm for a Robust 802.11 WLAN implementation
Wired Equivalent Privacy (WEP) protocol used within the IEEE 802.11 standard has "major security flaws" thus wireless local area networks (WLANs) using the protocol are ...
Taskin Koçak, Mohit Jagetia