Sciweavers

1007 search results - page 138 / 202
» The Complexity of Futile Questioning
Sort
View
SIGDOC
2006
ACM
15 years 6 months ago
What users say they want in documentation
While earlier work provided a partial view of users’ preferences about manuals, for most users in most work contexts the important question remains open: What do users want in d...
David G. Novick, Karen Ward
CSB
2005
IEEE
155views Bioinformatics» more  CSB 2005»
15 years 6 months ago
BioNavigation: Using Ontologies to Express Meaningful Navigational Queries Over Biological Resources
Exploiting the complex maze of publicly available Biological resources to implement scientific data collection pipelines poses a multitude of challenges to biologists in accurate...
Zoé Lacroix, Kaushal Parekh, Maria-Esther V...
FOCS
2005
IEEE
15 years 6 months ago
The Closest Substring problem with small distances
In the CLOSEST SUBSTRING problem k strings s1, ..., sk are given, and the task is to find a string s of length L such that each string si has a consecutive substring of length L ...
Dániel Marx
FOCS
2005
IEEE
15 years 6 months ago
Towards a Final Analysis of Pairing Heaps
Fredman, Sedgewick, Sleator, and Tarjan proposed the pairing heap as a self-adjusting, streamlined version of the Fibonacci heap. It provably supports all priority queue operation...
Seth Pettie
89
Voted
LICS
2005
IEEE
15 years 6 months ago
Proof-Theoretic Approach to Description-Logic
In recent work Baader has shown that a certain description logic with conjunction, existential quantification and with circular definitions has a polynomial time subsumption pro...
Martin Hofmann