10392 search results - page 1774 / 2079 » Introduction to Computer Science |
243
click to vote
KSEM
2007
Springer
16 years 24 days ago
2007
Springer
Traditional phrase matching approaches, which can discover documents containing exactly the same phrases, fail to detect documents including phrases that are semantically relevant,...
164
click to vote
MFCS
2007
Springer
16 years 24 days 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...
190
click to vote
MFCS
2007
Springer
16 years 24 days 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...
175
click to vote
MODELS
2007
Springer
16 years 23 days 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...
157
click to vote
POLICY
2007
Springer
16 years 23 days 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...