Sciweavers

6906 search results - page 416 / 1382
» An algorithm for modelling key terms
Sort
View
COCO
2004
Springer
78views Algorithms» more  COCO 2004»
16 years 7 days ago
Language Compression and Pseudorandom Generators
The language compression problem asks for succinct descriptions of the strings in a language A such that the strings can be efficiently recovered from their description when given...
Harry Buhrman, Troy Lee, Dieter van Melkebeek
ENTCS
2008
92views more  ENTCS 2008»
15 years 7 months ago
Redundancy Elimination for LF
We present a type system extending the dependent type theory LF, whose terms are more amenable to compact representation. This is achieved by carefully omitting certain subterms w...
Jason Reed
AIRS
2010
Springer
15 years 4 months ago
Advanced Training Set Construction for Retrieval in Historic Documents
Retrieval in historic documents with non-standard spelling requires a mapping from search terms onto the historic terms in the document. For describing this mapping, we have develo...
Andrea Ernst-Gerlach, Norbert Fuhr
GECCO
2007
Springer
168views Optimization» more  GECCO 2007»
16 years 1 months ago
Stability in the self-organized evolution of networks
The modeling and analysis of large networks of autonomous agents is an important topic with applications in many different disciplines. One way of modeling the development of such...
Thomas Jansen, Madeleine Theile
BMCBI
2007
166views more  BMCBI 2007»
15 years 6 months ago
How to decide which are the most pertinent overly-represented features during gene set enrichment analysis
Background: The search for enriched features has become widely used to characterize a set of genes or proteins. A key aspect of this technique is its ability to identify correlati...
Roland Barriot, David J. Sherman, Isabelle Dutour