1955 search results - page 54 / 391 » Can Computers Handle Adverbs |
157
Voted
RC
2007
15 years 3 months ago
2007
The search algorithm presented allows the CDF of a dependent variable to be bounded with 100%confidence,andallowsforaguaranteedevaluationof theerror involved.Thesereliabilitybound...
110
click to vote
SEMCO
2007
IEEE
15 years 10 months ago
2007
IEEE
This paper addresses the question of how to obtain consistent semantic annotation on the basis of a set of noisy texts. Many potential realworld applications of semantic computing...
144
Voted
PPAM
2007
Springer
15 years 10 months ago
2007
Springer
Lattice-Boltzmann (LB) methods are a well-known technique in the context of computational fluid dynamics. By nature, they can easily be parallelized but their adaptation to the Gr...
117
click to vote
ATVA
2005
Springer
15 years 9 months ago
2005
Springer
Abstract. Symbolic model checking provides partially effective verification procedures that can handle systems with an infinite state space. So-called “acceleration techniques...
116
click to vote
GI
2001
Springer
15 years 8 months ago
2001
Springer
Abstract: This paper presents the information aggregation methods enabling cost- and QoS-aware service deployment. It is expected that network management tools will require the net...