Sciweavers

15375 search results - page 12 / 3075
» cans 2008
Sort
View
COLING
1992
13 years 8 months ago
Can Computers Handle Adverbs?
The adverb is the most complicated, and perhaps also the most interesting part of speech. Past research in natural language processing, however, has not dealt seriously with adver...
Sumali Pin-Ngern Conlon, Martha W. Evens
UAI
1989
13 years 8 months ago
Can Uncertainty Management be Realized in a Finite Totally Ordered Probability Algebra?
In this paper, the feasibility of using finite totally ordered probability models under Aleliunas’s Theory of Probabilistic Logic [Aleliunas, 1988] is investigated. The general...
Yang Xiang, Michael P. Beddoes, David Poole
ENTCS
2008
125views more  ENTCS 2008»
13 years 7 months ago
Can Refinement be Automated?
We automatically verify Back's atomicity refinement law and a classical data refinement law for action systems. Our novel approach mechanises a refinement calculus based on K...
Peter Höfner, Georg Struth
IVC
2008
100views more  IVC 2008»
13 years 7 months ago
Attention can improve a simple model for object recognition
Object recognition is one of the most important tasks of the visual cortex. Even though it has been closely studied in the field of computer vision and neuroscience, the underlyin...
Edgar Bermudez Contreras, Hilary Buxton, Emmet Spi...
WICSA
2008
13 years 9 months ago
Can Styles Improve Architectural Pattern Reuse?
Software patterns are generic solutions to recurring problems. They are represented as a triplet (problem, context, solution). Several kinds of software patterns were identified, ...
Sorana Cîmpan, Vincent Couturier