Sciweavers

2157 search results - page 197 / 432
» Binary ant algorithm
Sort
View
IPL
2002
119views more  IPL 2002»
15 years 6 months ago
Randomized splay trees: Theoretical and experimental results
Splay trees are self-organizing binary search trees that were introduced by Sleator and Tarjan [12]. In this paper we present a randomized variant of these trees. The new algorith...
Susanne Albers, Marek Karpinski
ICASSP
2011
IEEE
14 years 10 months ago
Facial expression recognition using ensemble of classifiers
This paper presents a novel method for facial expression classification that employs the combination of two different feature sets in an ensemble approach. A pool of base classi...
Thiago H. H. Zavaschi, Alessandro L. Koerich, Luiz...
ESA
2011
Springer
257views Algorithms» more  ESA 2011»
14 years 6 months ago
Social-Aware Forwarding Improves Routing Performance in Pocket Switched Networks
We study and characterize social-aware forwarding protocols in opportunistic networks and we derive bounds on the expected message delivery time for two different routing protocol...
Josep Díaz, Alberto Marchetti-Spaccamela, D...
WDAG
2010
Springer
206views Algorithms» more  WDAG 2010»
15 years 4 months ago
Scalable Quantum Consensus for Crash Failures
We present a scalable quantum algorithm to solve binary consensus in a system of n crash-prone quantum processes. The algorithm works in O(polylog n) time sending O(n polylog n) qu...
Bogdan S. Chlebus, Dariusz R. Kowalski, Michal Str...
STOC
2003
ACM
142views Algorithms» more  STOC 2003»
16 years 6 months ago
Optimal probabilistic fingerprint codes
We construct binary codes for fingerprinting. Our codes for n users that are -secure against c pirates have length O(c2 log(n/ )). This improves the codes proposed by Boneh and Sh...
Gábor Tardos