Sciweavers

11862 search results - page 32 / 2373
» Relative information completeness
Sort
View
APAL
2005
88views more  APAL 2005»
13 years 7 months ago
Completing pseudojump operators
We investigate operators which take a set X to a set relatively computably enumerable in and above X by studying which such sets X can be so mapped into the Turing degree of K. We...
Richard Coles, Rodney G. Downey, Carl G. Jockusch ...
ICDCSW
2007
IEEE
14 years 1 months ago
A Context-aware Reminding System for Daily Activities of Dementia Patients
Older people with dementia often decline in short-term memory and forget what to do next to complete their activities of daily living (ADLs), such as tea-making and toothbrushing....
Hua Si, Seung Jin Kim, Nao Kawanishi, Hiroyuki Mor...
BMCBI
2005
81views more  BMCBI 2005»
13 years 7 months ago
Evolutionary sequence analysis of complete eukaryote genomes
Background: Gene duplication and gene loss during the evolution of eukaryotes have hindered attempts to estimate phylogenies and divergence times of species. Although current meth...
Jaime E. Blair, Prachi Shah, S. Blair Hedges
LFCS
2009
Springer
14 years 2 months ago
Completeness Results for Memory Logics
Memory logics are a family of modal logics in which standard relational structures are augmented with data structures and additional operations to modify and query these structure...
Carlos Areces, Santiago Figueira, Sergio Mera
SIAMDM
2010
170views more  SIAMDM 2010»
13 years 2 months ago
Complete Minors and Independence Number
Let G be a graph with n vertices and independence number . Hadwiger's conjecture implies that G contains a clique minor of order at least n/. In 1982, Duchet and Meyniel prov...
Jacob Fox