Sciweavers

896 search results - page 155 / 180
» On completeness of word reversing
Sort
View
FLAIRS
2008
13 years 10 months ago
Learning in the Lexical-Grammatical Interface
Children are facile at both discovering word boundaries and using those words to build higher-level structures in tandem. Current research treats lexical acquisition and grammar i...
Tom Armstrong, Tim Oates
CORR
2007
Springer
127views Education» more  CORR 2007»
13 years 8 months ago
Using decision problems in public key cryptography
There are several public key establishment protocols as well as complete public key cryptosystems based on allegedly hard problems from combinatorial (semi)group theory known by no...
Vladimir Shpilrain, Gabriel Zapata
INFORMATICALT
2006
88views more  INFORMATICALT 2006»
13 years 8 months ago
Improving the Performances of Asynchronous Algorithms by Combining the Nogood Processors with the Nogood Learning Techniques
Abstract. The asynchronous techniques that exist within the programming with distributed constraints are characterized by the occurrence of the nogood values during the search for ...
Ionel Muscalagiu, Vladimir Cretu
BMCBI
2005
152views more  BMCBI 2005»
13 years 8 months ago
Ranking the whole MEDLINE database according to a large training set using text indexing
Background: The MEDLINE database contains over 12 million references to scientific literature, ut 3/4 of recent articles including an abstract of the publication. Retrieval of ent...
Brian P. Suomela, Miguel A. Andrade
JCB
2007
118views more  JCB 2007»
13 years 8 months ago
Discovering Topological Motifs Using a Compact Notation
Discovering topological motifs or common topologies in one or more graphs is an important as well as an interesting problem. It had been classically viewed as the subgraph isomorp...
Laxmi Parida