Sciweavers

6829 search results - page 1012 / 1366
» Quantitative Generalizations of Languages
Sort
View
DIMACS
1996
15 years 8 months ago
Easier Ways to Win Logical Games
in Structure'95. 14] R. Fagin. Easier ways to win logical games. In Proc. DIMACS Workshop on Descriptive Complexity and Finite Models, AMS 1997. 15] R. Fagin, L. Stockmeyer, M...
Ronald Fagin
SIGSOFT
2004
ACM
16 years 7 months ago
System architecture: the context for scenario-based model synthesis
Constructing rigorous models for analysing the behaviour of concurrent and distributed systems is a complex task. Our aim is to facilitate model construction. Scenarios provide si...
Jeff Kramer, Jeff Magee, Robert Chatley, Sebasti&a...
ICDT
2009
ACM
128views Database» more  ICDT 2009»
16 years 7 months ago
Efficient asymmetric inclusion between regular expression types
The inclusion of Regular Expressions (REs) is the kernel of any type-checking algorithm for XML manipulation languages. XML applications would benefit from the extension of REs wi...
Dario Colazzo, Giorgio Ghelli, Carlo Sartiani
WWW
2008
ACM
16 years 7 months ago
Learning to classify short and sparse text & web with hidden topics from large-scale data collections
This paper presents a general framework for building classifiers that deal with short and sparse text & Web segments by making the most of hidden topics discovered from larges...
Xuan Hieu Phan, Minh Le Nguyen, Susumu Horiguchi
KDD
2008
ACM
178views Data Mining» more  KDD 2008»
16 years 7 months ago
Training structural svms with kernels using sampled cuts
Discriminative training for structured outputs has found increasing applications in areas such as natural language processing, bioinformatics, information retrieval, and computer ...
Chun-Nam John Yu, Thorsten Joachims
« Prev « First page 1012 / 1366 Last » Next »