1519 search results - page 252 / 304 » The Domain Dependence of Parsing |
155
click to vote
UAI
1996
15 years 7 months ago
1996
Many algorithms for processing probabilistic networks are dependent on the topological properties of the problem's structure. Such algorithmse.g., clustering, conditioning ar...
160
click to vote
AAAI
1990
15 years 7 months ago
1990
Temporal projection-predicting future states of a changing world-has been studied mainly as a formal problem. Researchers have been concerned with getting the concepts of causalit...
139
click to vote
DOCENG
2010
ACM
15 years 7 months ago
2010
ACM
Modern GUI toolkits, and especially RIA ones, propose the concept of binding to dynamically link domain data and their presentations. Bindings are very simple to use for predefine...
174
click to vote
ERCIMDL
2010
Springer
15 years 7 months ago
2010
Springer
Abstract. Recent work on analyzing query logs shows that a significant fraction of queries are temporal, i.e., relevancy is dependent on time, and temporal queries play an importan...
167
click to vote
DAGSTUHL
2009
15 years 7 months ago
2009
The selection of features that are relevant for a prediction or classification problem is an important problem in many domains involving high-dimensional data. Selecting features h...