Sciweavers

494 search results - page 48 / 99
» Heap Building Bounds
Sort
View
SPAA
2005
ACM
15 years 4 months ago
Randomization does not reduce the average delay in parallel packet switches
Switching cells in parallel is a common approach to build switches with very high external line rate and a large number of ports. A prime example is the parallel packet switch (in...
Hagit Attiya, David Hay
JUCS
2008
147views more  JUCS 2008»
14 years 11 months ago
On BCK Algebras - Part I.b: An Attempt to Treat Unitarily the Algebras of Logic. New Algebras
: Since all the algebras connected to logic have, more or less explicitely, an associated order relation, it follows that they have two presentations, dual to each other. We classi...
Afrodita Iorgulescu
JUCS
2007
100views more  JUCS 2007»
14 years 11 months ago
On BCK Algebras - Part I.a: An Attempt to Treat Unitarily the Algebras of Logic. New Algebras
: Since all the algebras connected to logic have, more or less explicitely, an associated order relation, it follows that they have two presentations, dual to each other. We classi...
Afrodita Iorgulescu
ECCC
2000
140views more  ECCC 2000»
14 years 10 months ago
Randomized Approximation Schemes for Scheduling Unrelated Parallel Machines
We consider the problem of Scheduling n Independent Jobs on m Unrelated Parallel Machines, when the number of machines m is xed. We address the standard problem of minimizing the ...
Pavlos Efraimidis, Paul G. Spirakis
ICML
2004
IEEE
15 years 11 months ago
Leveraging the margin more carefully
Boosting is a popular approach for building accurate classifiers. Despite the initial popular belief, boosting algorithms do exhibit overfitting and are sensitive to label noise. ...
Nir Krause, Yoram Singer