Sciweavers

1414 search results - page 36 / 283
» Combining Intruder Theories
Sort
View
SPAA
2004
ACM
14 years 3 months ago
Improved combination of online algorithms for acceptance and rejection
Given two admission control algorithms that are cA-acceptcompetitive and cR-reject-competitive respectively, we give two ways to make an algorithm that is simultaneously O(cA)acce...
David P. Bunde, Yishay Mansour
CF
2008
ACM
13 years 12 months ago
Exact combinational logic synthesis and non-standard circuit design
Using a new exact synthesizer that automatically induces minimal universal boolean function libraries, we introduce two indicators for comparing their expressiveness: the first ba...
Paul Tarau, Brenda Luderman
JILP
2000
103views more  JILP 2000»
13 years 9 months ago
Comparing and Combining Profiles
How much do two profiles of the same program differ? When has a profile changed enough to warrant reexamination of the profiled program? And how should two or more profiles be com...
Serap A. Savari, Cliff Young
MIA
2010
104views more  MIA 2010»
13 years 4 months ago
Combining atlas based segmentation and intensity classification with nearest neighbor transform and accuracy weighted vote
In this paper, different methods to improve atlas based segmentation are presented. The first technique is a new mapping of the labels of an atlas consistent with a given intensit...
Michaël Sdika
CP
2006
Springer
14 years 1 months ago
The Theory of Grammar Constraints
Abstract. By introducing the Regular Membership Constraint, Gilles Pesant pioneered the idea of basing constraints on formal languages. The paper presented here is highly motivated...
Meinolf Sellmann