Sciweavers

3653 search results - page 562 / 731
» Learning of Partial Languages
Sort
View
136
Voted
BMCBI
2005
99views more  BMCBI 2005»
15 years 3 months ago
Effective ambiguity checking in biosequence analysis
Background: Ambiguity is a problem in biosequence analysis that arises in various analysis tasks solved via dynamic programming, and in particular, in the modeling of families of ...
Janina Reeder, Peter Steffen, Robert Giegerich
137
Voted
AI
1999
Springer
15 years 3 months ago
Using Grice's maxim of Quantity to select the content of plan descriptions
Intelligent systems are often called upon to form plans that direct their own or other agents' activities. For these systems, the ability to describe plans to people in natur...
R. Michael Young
118
Voted
CORR
1998
Springer
82views Education» more  CORR 1998»
15 years 3 months ago
Name Strategy: Its Existence and Implications
It is argued that colour name strategy, object name strategy, and chunking strategy in memory are all aspects of the same general phenomena, called stereotyping, and this in turn ...
Mark D. Roberts
148
Voted
PVLDB
2008
132views more  PVLDB 2008»
15 years 3 months ago
Access control over uncertain data
Access control is the problem of regulating access to secret information based on certain context information. In traditional applications, context information is known exactly, p...
Vibhor Rastogi, Dan Suciu, Evan Welbourne
141
Voted
STTT
2010
132views more  STTT 2010»
15 years 1 months ago
Evaluation of Kermeta for solving graph-based problems
Kermeta is a meta-language for specifying the structure and behavior of graphs of interconnected objects called models. In this paper, we show that Kermeta is relatively suitable f...
Naouel Moha, Sagar Sen, Cyril Faucher, Olivier Bar...