Sciweavers

276 search results - page 32 / 56
» Decomposition tool for event-B
Sort
View
FLAIRS
2004
14 years 11 months ago
Transductive LSI for Short Text Classification Problems
This paper presents work that uses Transductive Latent Semantic Indexing (LSI) for text classification. In addition to relying on labeled training data, we improve classification ...
Sarah Zelikovitz
CORR
2008
Springer
97views Education» more  CORR 2008»
14 years 9 months ago
Directive words of episturmian words: equivalences and normalization
Episturmian morphisms constitute a powerful tool to study episturmian words. Indeed, any episturmian word can be infinitely decomposed over the set of pure episturmian morphisms. ...
Amy Glen, Florence Levé, Gwénaë...
FMSD
2008
110views more  FMSD 2008»
14 years 9 months ago
Automatic symbolic compositional verification by learning assumptions
Abstract Compositional reasoning aims to improve scalability of verification tools by reducing the original verification task into subproblems. The simplification is typically base...
Wonhong Nam, P. Madhusudan, Rajeev Alur
CORR
2007
Springer
117views Education» more  CORR 2007»
14 years 9 months ago
Dirac Notation, Fock Space and Riemann Metric Tensor in Information Retrieval Models
Using Dirac Notation as a powerful tool, we investigate the three classical Information Retrieval (IR) models and some their extensions. We show that almost all such models can be...
Xing M. Wang
ENTCS
2007
116views more  ENTCS 2007»
14 years 9 months ago
DisCComp - A Formal Model for Distributed Concurrent Components
Most large-scaled software systems are structured in distributed components to manage complexity and have to cope with concurrent executed threads. System decomposition and concur...
Andreas Rausch