Sciweavers

8094 search results - page 14 / 1619
» Improvements in Formula Generalization
Sort
View
VIP
2001
13 years 9 months ago
A Hierarchical Approach in Multilevel Thresholding Based on Maximum Entropy and Bayes' Formula
An efficient hierarchical approach for image multi-level thresholding is proposed based on the maximum entropy principle and Bayes' formula, in which no assumptions of the im...
Yan Chang, Alan M. N. Fu, Hong Yan
ENTCS
1998
94views more  ENTCS 1998»
13 years 7 months ago
Derivation of Characteristic Formulae
This paper shows how modal mu-calculus formulae characterizing finite-state processes up to strong or weak bisimulation can be derived directly from the well-known greatest fixp...
Markus Müller-Olm
CC
2010
Springer
282views System Software» more  CC 2010»
13 years 6 months ago
Lower Bounds on the Randomized Communication Complexity of Read-Once Functions
Abstract. We prove lower bounds on the randomized two-party communication complexity of functions that arise from read-once boolean formulae. A read-once boolean formula is a formu...
Nikos Leonardos, Michael Saks
SAT
2009
Springer
94views Hardware» more  SAT 2009»
14 years 2 months ago
Solving SAT for CNF Formulas with a One-Sided Restriction on Variable Occurrences
In this paper we consider the class of boolean formulas in Conjunctive Normal Form (CNF) where for each variable all but at most d occurrences are either positive or negative. This...
Daniel Johannsen, Igor Razgon, Magnus Wahlströ...
ASIACRYPT
2003
Springer
13 years 11 months ago
Parallelizing Explicit Formula for Arithmetic in the Jacobian of Hyperelliptic Curves
One of the recent thrust areas in research on hyperelliptic curve cryptography has been to obtain explicit formulae for performing arithmetic in the Jacobian of such curves. We con...
Pradeep Kumar Mishra, Palash Sarkar