Sciweavers

431 search results - page 20 / 87
» Implementing the maximum of monotone algorithms
Sort
View
HYBRID
2010
Springer
15 years 4 months ago
Automatic invariant generation for hybrid systems using ideal fixed points
We present computational techniques for automatically generating algebraic (polynomial equality) invariants for algebraic hybrid systems. Such systems involve ordinary differentia...
Sriram Sankaranarayanan
ICTAI
1997
IEEE
15 years 1 months ago
Prime Implicant Computation Using Satisfiability Algorithms
The computation of prime implicants has several and significant applications in different areas, including Automated Reasoning, Non-Monotonic Reasoning, Electronic Design Automati...
Vasco M. Manquinho, Paulo F. Flores, João P...
ISCC
2003
IEEE
130views Communications» more  ISCC 2003»
15 years 3 months ago
Balanced Batch LKH: New Proposal, Implementation and Performance Evaluation
Perfect Secrecy can only be achieved in multicast groups by ciphering data sent to the group with a different key every time a member joins or leaves the group. A Key Server must ...
Josep Pegueroles, Francisco Rico-Novella
ICIP
2001
IEEE
15 years 11 months ago
EM algorithms of Gaussian mixture model and hidden Markov model
The HMM (Hidden Markov Model) is a probabilistic model of the joint probability of a collection of random variables with both observations and states. The GMM (Gaussian Mixture Mo...
Guorong Xuan, Wei Zhang, Peiqi Chai
APPROX
2009
Springer
138views Algorithms» more  APPROX 2009»
15 years 4 months ago
Submodular Maximization over Multiple Matroids via Generalized Exchange Properties
Submodular-function maximization is a central problem in combinatorial optimization, generalizing many important NP-hard problems including Max Cut in digraphs, graphs and hypergr...
Jon Lee, Maxim Sviridenko, Jan Vondrák