Sciweavers

1855 search results - page 245 / 371
» Composing model programs for analysis
Sort
View
ICDAR
2007
IEEE
15 years 4 months ago
Handwritten Word Recognition Using Conditional Random Fields
The paper describes a lexicon driven approach for word recognition on handwritten documents using Conditional Random Fields(CRFs). CRFs are discriminative models and do not make a...
Shravya Shetty, Harish Srinivasan, Sargur N. Sriha...
APLAS
2006
ACM
15 years 1 months ago
Comparing Completeness Properties of Static Analyses and Their Logics
Abstract. Static analyses calculate abstract states, and their logics validate properties of the abstract states. We place into perspective the variety of forwards, backwards, func...
David A. Schmidt
CPHYSICS
2007
71views more  CPHYSICS 2007»
14 years 10 months ago
Simulation of n-qubit quantum systems. III. Quantum operations
During the last decade, several quantum information protocols, such as quantum key distribution, teleportation or quantum computation, have attracted a lot of interest. Despite th...
T. Radtke, S. Fritzsche
KESAMSTA
2009
Springer
15 years 2 months ago
Structural Changes in an Email-Based Social Network
ent Artificial Immune Systems (MAAIS) for Intrusion Detection: Abstraction from Danger Theory Chung-Ming Ou, C.R. Ou Ants-like Agents: a Model and Analysis Based on Natural Ants Be...
Krzysztof Juszczyszyn, Katarzyna Musial
CAV
2010
Springer
194views Hardware» more  CAV 2010»
15 years 1 months ago
LTSmin: Distributed and Symbolic Reachability
ions of ODE models (MAPLE, GNA). On the algorithmic side (Sec. 3.2), it supports two main streams in high-performance model checking: reachability analysis based on BDDs (symbolic)...
Stefan Blom, Jaco van de Pol, Michael Weber