Sciweavers

362 search results - page 39 / 73
» di 2007
Sort
View
ACL
1994
13 years 9 months ago
Word-Sense Disambiguation Using Decomposable Models
Most probabilistic classi ers used for word-sense disambiguationhave either been based on onlyone contextual feature or have used a model that is simply assumed to characterize th...
Rebecca F. Bruce, Janyce Wiebe
DBSEC
1996
125views Database» more  DBSEC 1996»
13 years 9 months ago
A Framework for High Assurance Security of Distributed Objects
High assurance security is di cult to achieve in distributed computer systems and databases because of their complexity, non-determinism and inherent heterogeneity. The practical ...
John Hale, Jody Threet, Sujeet Shenoi
MVA
1996
129views Computer Vision» more  MVA 1996»
13 years 9 months ago
Computation of Optical Flow Using Dynamic Programming
This paper presents an original algorithm for the computation of optical ow called Orthogonal Dynamic Programming (ODP) as well as several enhancements to it. The principle is to ...
Georges Quénot
NIPS
1996
13 years 9 months ago
Hidden Markov Decision Trees
We study a time series model that can be viewed as a decision tree with Markov temporal structure. The model is intractable for exact calculations, thus we utilize variational app...
Michael I. Jordan, Zoubin Ghahramani, Lawrence K. ...
DAGSTUHL
1990
13 years 8 months ago
Integrating Rules and Connectionism for Robust Reasoning
A connectionist model for robust reasoning, CONSYDERR, is proposed to account for some common reasoning patterns found in commonsense reasoning and to remedy the brittleness probl...
Ron Sun