Sciweavers

3172 search results - page 67 / 635
» On the Random-Self-Reducibility of Complete Sets
Sort
View
172
Voted
TABLEAUX
2009
Springer
15 years 7 months ago
Automated Synthesis of Tableau Calculi
This paper presents a method for synthesising sound and complete tableau calculi. Given a specification of the formal semantics of a logic, the method generates a set of tableau i...
Renate A. Schmidt, Dmitry Tishkovsky
104
Voted
CSB
2005
IEEE
223views Bioinformatics» more  CSB 2005»
15 years 6 months ago
Automatic Protein Function Annotation through Candidate Ortholog Clusters from Incomplete Genomes
Annotation of protein function often arises in the context of partially complete genomes but is not adequately addressed. We present an annotation method by extracting ortholog cl...
Akshay Vashist, Casimir A. Kulikowski, Ilya B. Muc...
ICMB
2005
IEEE
118views Business» more  ICMB 2005»
15 years 6 months ago
A Context-Sensitive Service Discovery Protocol for Mobile Computing Environments
Service discovery is important in mobile and pervasive computing environments, where the set of resources available to an entity changes dynamically over time. This paper describe...
Ricky Robinson, Jadwiga Indulska
114
Voted
ORDER
2010
177views more  ORDER 2010»
14 years 11 months ago
Sharp and Meager Elements in Orthocomplete Homogeneous Effect Algebras
We prove that every orthocomplete homogeneous effect algebra is sharply dominating. Let us denote the greatest sharp element below x by x↓. For every element x of an orthocomple...
Gejza Jenca
109
Voted
CORR
2011
Springer
144views Education» more  CORR 2011»
14 years 4 months ago
Rank Aggregation via Nuclear Norm Minimization
The process of rank aggregation is intimately intertwined with the structure of skew-symmetric matrices. We apply recent advances in the theory and algorithms of matrix completion...
David F. Gleich, Lek-Heng Lim