Sciweavers

12459 search results - page 107 / 2492
» cans 2006
Sort
View
INFORMATICALT
2000
126views more  INFORMATICALT 2000»
13 years 10 months ago
Commutation in Global Supermonoid of Free Monoids
This work is an attempt of generalization of the simple statement about the requirements of commutation of words for the case of languages. In the paper, the necessary condition fo...
Anna Brosalina, Boris Melnikov
IPL
2000
82views more  IPL 2000»
13 years 10 months ago
Estimating the number of vertices of a polyhedron
Given a polyhedron P by a list of inequalities we develop unbiased estimates of the number of vertices and bases of P. The estimates are based on applying tree estimation methods ...
David Avis, Luc Devroye
JASIS
2000
100views more  JASIS 2000»
13 years 10 months ago
Raising reliability of web search tool research through replication and chaos theory
: Because the World Wide Web is a dynamic collection of information, the Web search tools (or "search engines") that index the Web are dynamic. Traditional information re...
Scott Nicholson
JCB
2000
129views more  JCB 2000»
13 years 10 months ago
Prediction of RNA Base Pairing Probabilities on Massively Parallel Computers
We present an implementation of McCaskill's algorithm for computing the base pair probabilities of an RNA molecule for massively parallel message passing architectures. The p...
Martin Fekete, Ivo L. Hofacker, Peter F. Stadler
MLQ
2000
90views more  MLQ 2000»
13 years 10 months ago
Approximate Reasoning Based on Similarity
The connection between similarity logic and the theory of closure operators is examined. Indeed one proves that the consequence relation defined in [14] can be obtained by composin...
Loredana Biacino, Giangiacomo Gerla, Mingsheng Yin...