Sciweavers

2517 search results - page 133 / 504
» Specifying Weak Sets
Sort
View
145
Voted
ISCC
2000
IEEE
112views Communications» more  ISCC 2000»
15 years 10 months ago
RED Behavior with Different Packet Sizes
We consider the adaptation of random early detection (RED) as a buffer management algorithm for TCP traffic in Internet gateways where different maximum transfer units (MTUs) are ...
Stefaan De Cnodder, Omar Elloumi, Kenny Pauwels
IWPC
2000
IEEE
15 years 10 months ago
A Framework for Experimental Evaluation of Clustering Techniques
Experimental evaluation of clustering techniques for component recovery is necessary in order to analyze their strengths and weaknesses in comparison to other techniques. For comp...
Rainer Koschke, Thomas Eisenbarth
APLAS
2007
ACM
15 years 9 months ago
Complete Lattices and Up-To Techniques
Abstract. We propose a theory of up-to techniques for proofs by coinduction, in the setting of complete lattices. This theory improves over existing results by providing a way to c...
Damien Pous
DAGM
2007
Springer
15 years 9 months ago
Greedy-Based Design of Sparse Two-Stage SVMs for Fast Classification
Cascades of classifiers constitute an important architecture for fast object detection. While boosting of simple (weak) classifiers provides an established framework, the design of...
Rezaul Karim, Martin Bergtholdt, Jörg H. Kapp...
136
Voted
DEON
2004
Springer
15 years 9 months ago
Conflicting Imperatives and Dyadic Deontic Logic
Often a set of imperatives or norms seems satisfiable from the outset, but conflicts arise when ways to fulfill all are ruled out by unfortunate circumstances. Semantic methods to ...
Jörg Hansen