Sciweavers

2434 search results - page 287 / 487
» Algorithmic Randomness of Closed Sets
Sort
View
137
Voted
ICML
2010
IEEE
15 years 5 months ago
Deep networks for robust visual recognition
Deep Belief Networks (DBNs) are hierarchical generative models which have been used successfully to model high dimensional visual data. However, they are not robust to common vari...
Yichuan Tang, Chris Eliasmith
ACTAC
2007
69views more  ACTAC 2007»
15 years 4 months ago
Synthesising Robust Schedules for Minimum Disruption Repair Using Linear Programming
An o-line scheduling algorithm considers resource, precedence, and synchronisation requirements of a task graph, and generates a schedule guaranteeing its timing requirements. Th...
Dávid Hanák, Nagarajan Kandasamy
CORR
2000
Springer
95views Education» more  CORR 2000»
15 years 3 months ago
Effect of different packet sizes on RED performance
We consider the adaptation of random early detection (RED) as an active queue management algorithm for TCP traffic in Internet gateways where different maximum transfer units (MTU...
Stefaan De Cnodder, Omar Elloumi, Kenny Pauwels
118
Voted
NECO
2007
90views more  NECO 2007»
15 years 3 months ago
Neighborhood Property-Based Pattern Selection for Support Vector Machines
Support Vector Machine (SVM) has been spotlighted in the machine learning community thanks to its theoretical soundness and practical performance. When applied to a large data set...
Hyunjung Shin, Sungzoon Cho
ORL
2010
85views more  ORL 2010»
15 years 2 months ago
Stable routing under the Spanning Tree Protocol
The Spanning Tree Protocol routes traffic on shortest path trees. If some edges fail, the traffic has to be rerouted consequently, setting up alternative trees. In this paper we d...
Fabrizio Grandoni, Gaia Nicosia, Gianpaolo Oriolo,...