Sciweavers

4066 search results - page 28 / 814
» Almost Complete Sets
Sort
View
ACS
2010
13 years 9 months ago
Lawvere Completion and Separation Via Closure
For a quantale V, first a closure-theoretic approach to completeness and separation in V-categories is presented. This approach is then generalized to T-categories, where T is a to...
Dirk Hofmann, Walter Tholen
BMCBI
2007
137views more  BMCBI 2007»
13 years 8 months ago
PlnTFDB: an integrative plant transcription factor database
Background: Transcription factors (TFs) are key regulatory proteins that enhance or repress the transcriptional rate of their target genes by binding to specific promoter regions ...
Diego Mauricio Riaño-Pachón, Sloboda...
CDC
2010
IEEE
176views Control Systems» more  CDC 2010»
13 years 3 months ago
Random projection algorithms for convex set intersection problems
The focus of this paper is on the set intersection problem for closed convex sets admitting projection operation in a closed form. The objective is to investigate algorithms that w...
Angelia Nedic
TCS
2002
13 years 8 months ago
Martin's game: a lower bound for the number of sets
We investigate Martin's game (as described in Arruda et al. (Eds.), On Random R. E. Sets, Non-Classical Logics, Model Theory and Computability, North-Holland, Amsterdam, 1977...
M. Ageev
ACL
2001
13 years 10 months ago
What is the Minimal Set of Fragments that Achieves Maximal Parse Accuracy?
We aim at finding the minimal set of fragments which achieves maximal parse accuracy in Data Oriented Parsing. Experiments with the Penn Wall Street Journal treebank show that cou...
Rens Bod