11345 search results - page 2000 / 2269 » Foundations of Computer Science |
112
click to vote
MFCS
2007
Springer
15 years 9 months ago
2007
Springer
Consider a rooted directed acyclic graph G = (V, E) with root r, representing a collection V of web pages connected via a set E of hyperlinks. Each node v is associated with the pr...
143
click to vote
MFCS
2007
Springer
15 years 9 months ago
2007
Springer
In formal language theory, many families of languages are defined using grammars or finite acceptors like pushdown automata and Turing machines. For instance, context-sensitive l...
128
Voted
MODELS
2007
Springer
15 years 9 months ago
2007
Springer
Abstract. This paper describes our experiences in defining the processes associated with preparing and administrating chemotherapy and then using those process definitions as the b...
122
click to vote
POLICY
2007
Springer
15 years 9 months ago
2007
Springer
The richness of today’s electronic communications mirrors physical world: activities such as shopping, business and scientific collaboration are conducted online. Current intera...
132
click to vote
WABI
2007
Springer
15 years 9 months ago
2007
Springer
Christopher James Langmead⋆ and Sumit Kumar Jha Department of Computer Science, Carnegie Mellon University We present a novel approach for predicting protein folding kinetics us...