Sciweavers

446 search results - page 29 / 90
» Learning discrete categorial grammars from structures
Sort
View
APN
2010
Springer
13 years 11 months ago
GreatSPN Enhanced with Decision Diagram Data Structures
Decision diagrams (DDs) have made their way into Petri net (PN) tools either in the form of new tools (usually designed from scratch to use DDs) or as enhancements to existing tool...
Junaid Babar, Marco Beccuti, Susanna Donatelli, An...
FLAIRS
2008
13 years 10 months ago
Learning Dynamic Naive Bayesian Classifiers
Hidden Markov models are a powerful technique to model and classify temporal sequences, such as in speech and gesture recognition. However, defining these models is still an art: ...
Miriam Martínez, Luis Enrique Sucar
DOCENG
2007
ACM
13 years 11 months ago
A document object modeling method to retrieve data from a very large XML document
Document Object Modeling (DOM) is widely used approach for retrieving data from an XML document. If the size of the XML document is very large, however, using the DOM approach for...
Seung Min Kim, Suk I. Yoo, Eunji Hong, Tae Gwon Ki...
KDD
2004
ACM
145views Data Mining» more  KDD 2004»
14 years 29 days ago
A graph-theoretic approach to extract storylines from search results
We present a graph-theoretic approach to discover storylines from search results. Storylines are windows that offer glimpses into interesting themes latent among the top search re...
Ravi Kumar, Uma Mahadevan, D. Sivakumar
STOC
2012
ACM
221views Algorithms» more  STOC 2012»
11 years 10 months ago
From query complexity to computational complexity
We consider submodular optimization problems, and provide a general way of translating oracle inapproximability results arising from the symmetry gap technique to computational co...
Shahar Dobzinski, Jan Vondrák