Sciweavers

1648 search results - page 173 / 330
» Structuring namespace descriptions
Sort
View
RECOMB
2002
Springer
16 years 4 months ago
Monotony of surprise and large-scale quest for unusual words
The problem of characterizing and detecting recurrent sequence patterns such as substrings or motifs and related associations or rules is variously pursued in order to compress da...
Alberto Apostolico, Mary Ellen Bock, Stefano Lonar...
VALUETOOLS
2006
ACM
164views Hardware» more  VALUETOOLS 2006»
15 years 10 months ago
Analysis of Markov reward models using zero-suppressed multi-terminal BDDs
High-level stochastic description methods such as stochastic Petri nets, stochastic UML statecharts etc., together with specifications of performance variables (PVs), enable a co...
Kai Lampka, Markus Siegle
ESWS
2008
Springer
15 years 6 months ago
Contextual and Metadata-based Approach for the Semantic Annotation of Heterogeneous Documents
We present SHIRI-Annot an automatic ontology-driven and unsupervised approach for the semantic annotation of documents which contain well structured parts and not well structured o...
Mouhamadou Thiam, Nathalie Pernelle, Nacéra...
BMCBI
2010
70views more  BMCBI 2010»
15 years 4 months ago
The Text-mining based PubChem Bioassay neighboring analysis
Background: In recent years, the number of High Throughput Screening (HTS) assays deposited in PubChem has grown quickly. As a result, the volume of both the structured informatio...
Lianyi Han, Tugba O. Suzek, Yanli Wang, Steve H. B...
DIMACS
1996
15 years 5 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